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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:38:56,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:38:56,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:38:56,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:38:56,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:38:56,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:38:56,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:38:56,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:38:56,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:38:56,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:38:56,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:38:56,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:38:56,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:38:56,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:38:56,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:38:56,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:38:56,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:38:56,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:38:56,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:38:56,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:38:56,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:38:56,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:38:56,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:38:56,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:38:56,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:38:56,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:38:56,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:38:56,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:38:56,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:38:56,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:38:56,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:38:56,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:38:56,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:38:56,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:38:56,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:38:56,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:38:56,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:38:56,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:38:56,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:38:56,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:38:56,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:38:56,611 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:38:56,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:38:56,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:38:56,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:38:56,627 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:38:56,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:38:56,628 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:38:56,628 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:38:56,628 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:38:56,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:38:56,629 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:38:56,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:38:56,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:38:56,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:38:56,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:38:56,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:38:56,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:38:56,632 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:38:56,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:38:56,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:38:56,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:38:56,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:38:56,633 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:38:56,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:38:56,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:38:56,633 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:38:56,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:38:56,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:38:56,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:38:56,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:38:56,682 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:38:56,682 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:38:56,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4b504d7/830d1f97999049ab83535b5fd17bcbc6/FLAGbe23817b8 [2019-09-10 07:38:57,216 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:38:57,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:38:57,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4b504d7/830d1f97999049ab83535b5fd17bcbc6/FLAGbe23817b8 [2019-09-10 07:38:57,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4b504d7/830d1f97999049ab83535b5fd17bcbc6 [2019-09-10 07:38:57,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:38:57,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:38:57,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:38:57,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:38:57,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:38:57,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:38:57" (1/1) ... [2019-09-10 07:38:57,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:57, skipping insertion in model container [2019-09-10 07:38:57,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:38:57" (1/1) ... [2019-09-10 07:38:57,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:38:57,669 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:38:58,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:38:58,144 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:38:58,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:38:58,458 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:38:58,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58 WrapperNode [2019-09-10 07:38:58,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:38:58,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:38:58,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:38:58,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:38:58,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (1/1) ... [2019-09-10 07:38:58,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:38:58,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:38:58,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:38:58,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:38:58,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (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:38:58,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:38:58,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:38:58,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:38:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:38:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:38:58,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:38:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:38:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:38:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:38:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:38:58,647 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:38:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:38:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:38:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:38:58,649 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:38:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:38:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:38:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:38:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:38:59,900 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:38:59,900 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:38:59,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:38:59 BoogieIcfgContainer [2019-09-10 07:38:59,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:38:59,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:38:59,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:38:59,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:38:59,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:38:57" (1/3) ... [2019-09-10 07:38:59,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748c4df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:38:59, skipping insertion in model container [2019-09-10 07:38:59,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:38:58" (2/3) ... [2019-09-10 07:38:59,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748c4df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:38:59, skipping insertion in model container [2019-09-10 07:38:59,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:38:59" (3/3) ... [2019-09-10 07:38:59,917 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:38:59,928 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:38:59,951 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:38:59,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:39:00,004 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:39:00,005 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:39:00,005 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:39:00,005 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:39:00,005 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:39:00,006 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:39:00,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:39:00,006 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:39:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2019-09-10 07:39:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:39:00,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:00,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:00,086 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1982608136, now seen corresponding path program 1 times [2019-09-10 07:39:00,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:00,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:00,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:00,626 INFO L134 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:39:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:00,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:00,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:00,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:00,655 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 5 states. [2019-09-10 07:39:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:01,112 INFO L93 Difference]: Finished difference Result 247 states and 407 transitions. [2019-09-10 07:39:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:01,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:39:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:01,138 INFO L225 Difference]: With dead ends: 247 [2019-09-10 07:39:01,138 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 07:39:01,142 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:39:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 07:39:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-10 07:39:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-10 07:39:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2019-09-10 07:39:01,233 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 51 [2019-09-10 07:39:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:01,234 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2019-09-10 07:39:01,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2019-09-10 07:39:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:39:01,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:01,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,246 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1667829799, now seen corresponding path program 1 times [2019-09-10 07:39:01,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:01,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:01,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:01,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:01,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:01,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:01,441 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand 5 states. [2019-09-10 07:39:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:01,670 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2019-09-10 07:39:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:01,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:39:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:01,674 INFO L225 Difference]: With dead ends: 181 [2019-09-10 07:39:01,675 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 07:39:01,676 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:39:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 07:39:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-10 07:39:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 07:39:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2019-09-10 07:39:01,693 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 51 [2019-09-10 07:39:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:01,694 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2019-09-10 07:39:01,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2019-09-10 07:39:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:39:01,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:01,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:01,696 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1063133710, now seen corresponding path program 1 times [2019-09-10 07:39:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:01,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:01,836 INFO L134 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:39:01,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:01,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:01,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:01,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:01,839 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand 5 states. [2019-09-10 07:39:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:01,985 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-09-10 07:39:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:01,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:39:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:01,989 INFO L225 Difference]: With dead ends: 159 [2019-09-10 07:39:01,989 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 07:39:01,989 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:39:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 07:39:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-10 07:39:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 07:39:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2019-09-10 07:39:01,996 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 51 [2019-09-10 07:39:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:01,997 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2019-09-10 07:39:01,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2019-09-10 07:39:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:39:01,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:01,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,999 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1591584928, now seen corresponding path program 1 times [2019-09-10 07:39:02,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:02,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:02,159 INFO L134 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:39:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:39:02,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:02,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:39:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:39:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:39:02,162 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand 8 states. [2019-09-10 07:39:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:02,496 INFO L93 Difference]: Finished difference Result 231 states and 285 transitions. [2019-09-10 07:39:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:39:02,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-10 07:39:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:02,498 INFO L225 Difference]: With dead ends: 231 [2019-09-10 07:39:02,498 INFO L226 Difference]: Without dead ends: 231 [2019-09-10 07:39:02,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:39:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-10 07:39:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 159. [2019-09-10 07:39:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 07:39:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2019-09-10 07:39:02,523 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 52 [2019-09-10 07:39:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:02,524 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2019-09-10 07:39:02,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:39:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2019-09-10 07:39:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:39:02,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:02,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:02,525 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1153830128, now seen corresponding path program 1 times [2019-09-10 07:39:02,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:02,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:02,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:02,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:02,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:02,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:02,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:02,726 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand 9 states. [2019-09-10 07:39:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:03,445 INFO L93 Difference]: Finished difference Result 329 states and 431 transitions. [2019-09-10 07:39:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:03,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-10 07:39:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:03,448 INFO L225 Difference]: With dead ends: 329 [2019-09-10 07:39:03,448 INFO L226 Difference]: Without dead ends: 329 [2019-09-10 07:39:03,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-10 07:39:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 159. [2019-09-10 07:39:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 07:39:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2019-09-10 07:39:03,460 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 194 transitions. Word has length 52 [2019-09-10 07:39:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:03,461 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 194 transitions. [2019-09-10 07:39:03,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2019-09-10 07:39:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:39:03,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:03,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,463 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 709117384, now seen corresponding path program 1 times [2019-09-10 07:39:03,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:03,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:03,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:03,662 INFO L134 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:39:03,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:03,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:03,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:03,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:03,666 INFO L87 Difference]: Start difference. First operand 159 states and 194 transitions. Second operand 9 states. [2019-09-10 07:39:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:04,257 INFO L93 Difference]: Finished difference Result 333 states and 436 transitions. [2019-09-10 07:39:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:39:04,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-10 07:39:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:04,261 INFO L225 Difference]: With dead ends: 333 [2019-09-10 07:39:04,261 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 07:39:04,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 07:39:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 159. [2019-09-10 07:39:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 07:39:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2019-09-10 07:39:04,267 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 52 [2019-09-10 07:39:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:04,268 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2019-09-10 07:39:04,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2019-09-10 07:39:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:39:04,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:04,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,269 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -547853405, now seen corresponding path program 1 times [2019-09-10 07:39:04,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:04,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:04,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:04,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:04,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:04,974 INFO L134 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:39:04,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:04,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:39:04,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:04,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:39:04,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:39:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:39:04,976 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand 15 states. [2019-09-10 07:39:05,559 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:39:05,697 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:39:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:06,529 INFO L93 Difference]: Finished difference Result 326 states and 425 transitions. [2019-09-10 07:39:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:39:06,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-09-10 07:39:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:06,531 INFO L225 Difference]: With dead ends: 326 [2019-09-10 07:39:06,532 INFO L226 Difference]: Without dead ends: 326 [2019-09-10 07:39:06,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:39:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-10 07:39:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 148. [2019-09-10 07:39:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 07:39:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2019-09-10 07:39:06,537 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 54 [2019-09-10 07:39:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:06,538 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2019-09-10 07:39:06,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:39:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2019-09-10 07:39:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:39:06,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:06,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,539 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:06,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1033756485, now seen corresponding path program 1 times [2019-09-10 07:39:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:06,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:07,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:07,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:39:07,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:07,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:39:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:39:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:39:07,230 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand 16 states. [2019-09-10 07:39:07,794 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:39:07,931 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:39:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:08,723 INFO L93 Difference]: Finished difference Result 257 states and 312 transitions. [2019-09-10 07:39:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:39:08,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-09-10 07:39:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:08,727 INFO L225 Difference]: With dead ends: 257 [2019-09-10 07:39:08,727 INFO L226 Difference]: Without dead ends: 257 [2019-09-10 07:39:08,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:39:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-10 07:39:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 158. [2019-09-10 07:39:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-10 07:39:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2019-09-10 07:39:08,733 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 54 [2019-09-10 07:39:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:08,734 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2019-09-10 07:39:08,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:39:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2019-09-10 07:39:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:39:08,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:08,735 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,735 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash 372095971, now seen corresponding path program 1 times [2019-09-10 07:39:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:08,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:08,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:08,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:08,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:09,249 INFO L134 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:39:09,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:09,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:39:09,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:09,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:39:09,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:39:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:39:09,251 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand 12 states. [2019-09-10 07:39:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:10,003 INFO L93 Difference]: Finished difference Result 267 states and 345 transitions. [2019-09-10 07:39:10,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:39:10,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 07:39:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:10,007 INFO L225 Difference]: With dead ends: 267 [2019-09-10 07:39:10,007 INFO L226 Difference]: Without dead ends: 267 [2019-09-10 07:39:10,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:39:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-10 07:39:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 154. [2019-09-10 07:39:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-10 07:39:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2019-09-10 07:39:10,014 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 55 [2019-09-10 07:39:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:10,014 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2019-09-10 07:39:10,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:39:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2019-09-10 07:39:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:39:10,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:10,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:10,016 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -27651357, now seen corresponding path program 1 times [2019-09-10 07:39:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:10,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:10,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:10,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:10,679 INFO L134 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:39:10,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:10,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:39:10,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:10,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:39:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:39:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:39:10,681 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand 14 states. [2019-09-10 07:39:11,153 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 07:39:11,328 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:39:11,464 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:39:11,624 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:39:11,987 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-09-10 07:39:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:12,549 INFO L93 Difference]: Finished difference Result 478 states and 644 transitions. [2019-09-10 07:39:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:39:12,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-10 07:39:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:12,554 INFO L225 Difference]: With dead ends: 478 [2019-09-10 07:39:12,554 INFO L226 Difference]: Without dead ends: 478 [2019-09-10 07:39:12,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:39:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-10 07:39:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 146. [2019-09-10 07:39:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-10 07:39:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2019-09-10 07:39:12,562 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 55 [2019-09-10 07:39:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:12,562 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2019-09-10 07:39:12,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:39:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2019-09-10 07:39:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:39:12,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:12,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:12,563 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 320614258, now seen corresponding path program 1 times [2019-09-10 07:39:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:12,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:12,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:12,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:12,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:12,671 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand 9 states. [2019-09-10 07:39:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:13,160 INFO L93 Difference]: Finished difference Result 210 states and 263 transitions. [2019-09-10 07:39:13,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:39:13,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-10 07:39:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:13,162 INFO L225 Difference]: With dead ends: 210 [2019-09-10 07:39:13,162 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 07:39:13,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:39:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 07:39:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2019-09-10 07:39:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-10 07:39:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2019-09-10 07:39:13,168 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 55 [2019-09-10 07:39:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:13,169 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2019-09-10 07:39:13,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2019-09-10 07:39:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:39:13,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:13,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,170 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1777208038, now seen corresponding path program 1 times [2019-09-10 07:39:13,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:13,295 INFO L134 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:39:13,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:13,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:13,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:13,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:13,299 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 9 states. [2019-09-10 07:39:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:13,827 INFO L93 Difference]: Finished difference Result 210 states and 262 transitions. [2019-09-10 07:39:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:39:13,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-10 07:39:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:13,829 INFO L225 Difference]: With dead ends: 210 [2019-09-10 07:39:13,829 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 07:39:13,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:39:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 07:39:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2019-09-10 07:39:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-10 07:39:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2019-09-10 07:39:13,834 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 55 [2019-09-10 07:39:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:13,834 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2019-09-10 07:39:13,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2019-09-10 07:39:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:39:13,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:13,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,836 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 570385884, now seen corresponding path program 1 times [2019-09-10 07:39:13,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:13,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:13,937 INFO L134 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:39:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:13,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:13,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:13,939 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand 9 states. [2019-09-10 07:39:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:14,495 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2019-09-10 07:39:14,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:39:14,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-10 07:39:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:14,498 INFO L225 Difference]: With dead ends: 210 [2019-09-10 07:39:14,498 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 07:39:14,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:39:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 07:39:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2019-09-10 07:39:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-10 07:39:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2019-09-10 07:39:14,511 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 56 [2019-09-10 07:39:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:14,512 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2019-09-10 07:39:14,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2019-09-10 07:39:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:39:14,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:14,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:14,514 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash 474332301, now seen corresponding path program 1 times [2019-09-10 07:39:14,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:14,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:14,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:14,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:14,905 INFO L134 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:39:14,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:39:14,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:14,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:39:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:39:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:39:14,907 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 12 states. [2019-09-10 07:39:15,256 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-10 07:39:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:15,869 INFO L93 Difference]: Finished difference Result 296 states and 389 transitions. [2019-09-10 07:39:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:39:15,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-10 07:39:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:15,871 INFO L225 Difference]: With dead ends: 296 [2019-09-10 07:39:15,871 INFO L226 Difference]: Without dead ends: 296 [2019-09-10 07:39:15,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:39:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-10 07:39:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 140. [2019-09-10 07:39:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 07:39:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-09-10 07:39:15,878 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 57 [2019-09-10 07:39:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:15,878 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-09-10 07:39:15,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:39:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-09-10 07:39:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:39:15,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:15,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:15,879 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:15,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1201954827, now seen corresponding path program 1 times [2019-09-10 07:39:15,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:15,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:15,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:16,327 INFO L134 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:39:16,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:16,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:39:16,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:16,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:39:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:39:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:39:16,330 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 18 states. [2019-09-10 07:39:16,457 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:39:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:18,082 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2019-09-10 07:39:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:39:18,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-09-10 07:39:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:18,084 INFO L225 Difference]: With dead ends: 313 [2019-09-10 07:39:18,084 INFO L226 Difference]: Without dead ends: 313 [2019-09-10 07:39:18,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:39:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-10 07:39:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 140. [2019-09-10 07:39:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 07:39:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2019-09-10 07:39:18,091 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 57 [2019-09-10 07:39:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:18,091 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2019-09-10 07:39:18,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:39:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2019-09-10 07:39:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:39:18,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:18,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:18,092 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2038592951, now seen corresponding path program 1 times [2019-09-10 07:39:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:18,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:18,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:18,359 INFO L134 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:39:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:39:18,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:18,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:39:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:39:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:39:18,360 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand 10 states. [2019-09-10 07:39:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:18,892 INFO L93 Difference]: Finished difference Result 321 states and 433 transitions. [2019-09-10 07:39:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:39:18,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:39:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:18,896 INFO L225 Difference]: With dead ends: 321 [2019-09-10 07:39:18,896 INFO L226 Difference]: Without dead ends: 321 [2019-09-10 07:39:18,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:39:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-10 07:39:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 122. [2019-09-10 07:39:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-10 07:39:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2019-09-10 07:39:18,901 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 58 [2019-09-10 07:39:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:18,902 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2019-09-10 07:39:18,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:39:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2019-09-10 07:39:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:39:18,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:18,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:18,903 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 467030080, now seen corresponding path program 1 times [2019-09-10 07:39:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:18,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:19,541 INFO L134 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:39:19,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:19,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:39:19,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:19,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:39:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:39:19,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:39:19,542 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand 13 states. [2019-09-10 07:39:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:20,520 INFO L93 Difference]: Finished difference Result 364 states and 501 transitions. [2019-09-10 07:39:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:39:20,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-09-10 07:39:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:20,523 INFO L225 Difference]: With dead ends: 364 [2019-09-10 07:39:20,523 INFO L226 Difference]: Without dead ends: 364 [2019-09-10 07:39:20,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:39:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-10 07:39:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 104. [2019-09-10 07:39:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-10 07:39:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2019-09-10 07:39:20,534 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 58 [2019-09-10 07:39:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:20,534 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2019-09-10 07:39:20,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:39:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2019-09-10 07:39:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:39:20,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:20,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,539 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1716811533, now seen corresponding path program 1 times [2019-09-10 07:39:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:20,593 INFO L134 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:39:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:20,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:20,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:20,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:20,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:20,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:20,595 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand 3 states. [2019-09-10 07:39:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:20,616 INFO L93 Difference]: Finished difference Result 143 states and 184 transitions. [2019-09-10 07:39:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:20,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:39:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:20,618 INFO L225 Difference]: With dead ends: 143 [2019-09-10 07:39:20,618 INFO L226 Difference]: Without dead ends: 143 [2019-09-10 07:39:20,618 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:39:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-10 07:39:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-09-10 07:39:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-10 07:39:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2019-09-10 07:39:20,623 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 75 [2019-09-10 07:39:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:20,623 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2019-09-10 07:39:20,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2019-09-10 07:39:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:39:20,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:20,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,625 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -102634, now seen corresponding path program 1 times [2019-09-10 07:39:20,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:20,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:20,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:39:20,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:20,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:39:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:39:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:39:20,705 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 7 states. [2019-09-10 07:39:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:21,008 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2019-09-10 07:39:21,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:39:21,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-09-10 07:39:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:21,011 INFO L225 Difference]: With dead ends: 393 [2019-09-10 07:39:21,011 INFO L226 Difference]: Without dead ends: 393 [2019-09-10 07:39:21,011 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:39:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-10 07:39:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 239. [2019-09-10 07:39:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-10 07:39:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 328 transitions. [2019-09-10 07:39:21,021 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 328 transitions. Word has length 77 [2019-09-10 07:39:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:21,021 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 328 transitions. [2019-09-10 07:39:21,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:39:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 328 transitions. [2019-09-10 07:39:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:39:21,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:21,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -85584643, now seen corresponding path program 1 times [2019-09-10 07:39:21,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:21,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,066 INFO L134 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:39:21,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:21,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:21,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:21,067 INFO L87 Difference]: Start difference. First operand 239 states and 328 transitions. Second operand 3 states. [2019-09-10 07:39:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:21,095 INFO L93 Difference]: Finished difference Result 397 states and 547 transitions. [2019-09-10 07:39:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:21,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:39:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:21,098 INFO L225 Difference]: With dead ends: 397 [2019-09-10 07:39:21,098 INFO L226 Difference]: Without dead ends: 397 [2019-09-10 07:39:21,098 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:39:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-10 07:39:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 391. [2019-09-10 07:39:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-10 07:39:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 542 transitions. [2019-09-10 07:39:21,108 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 542 transitions. Word has length 77 [2019-09-10 07:39:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:21,109 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 542 transitions. [2019-09-10 07:39:21,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 542 transitions. [2019-09-10 07:39:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:39:21,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:21,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,110 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash -19091131, now seen corresponding path program 1 times [2019-09-10 07:39:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,155 INFO L134 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:39:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:21,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:21,157 INFO L87 Difference]: Start difference. First operand 391 states and 542 transitions. Second operand 3 states. [2019-09-10 07:39:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:21,184 INFO L93 Difference]: Finished difference Result 561 states and 783 transitions. [2019-09-10 07:39:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:21,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:39:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:21,187 INFO L225 Difference]: With dead ends: 561 [2019-09-10 07:39:21,187 INFO L226 Difference]: Without dead ends: 561 [2019-09-10 07:39:21,188 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:39:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-10 07:39:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-09-10 07:39:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-10 07:39:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 782 transitions. [2019-09-10 07:39:21,201 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 782 transitions. Word has length 77 [2019-09-10 07:39:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:21,202 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 782 transitions. [2019-09-10 07:39:21,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 782 transitions. [2019-09-10 07:39:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:39:21,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:21,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,204 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 614575382, now seen corresponding path program 1 times [2019-09-10 07:39:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:21,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:39:21,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:39:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:39:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:39:21,294 INFO L87 Difference]: Start difference. First operand 559 states and 782 transitions. Second operand 7 states. [2019-09-10 07:39:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:21,762 INFO L93 Difference]: Finished difference Result 1497 states and 2096 transitions. [2019-09-10 07:39:21,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:39:21,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-09-10 07:39:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:21,773 INFO L225 Difference]: With dead ends: 1497 [2019-09-10 07:39:21,773 INFO L226 Difference]: Without dead ends: 1497 [2019-09-10 07:39:21,778 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:39:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-10 07:39:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 949. [2019-09-10 07:39:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-09-10 07:39:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1344 transitions. [2019-09-10 07:39:21,810 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1344 transitions. Word has length 77 [2019-09-10 07:39:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:21,810 INFO L475 AbstractCegarLoop]: Abstraction has 949 states and 1344 transitions. [2019-09-10 07:39:21,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:39:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1344 transitions. [2019-09-10 07:39:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:39:21,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:21,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,812 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -983370934, now seen corresponding path program 1 times [2019-09-10 07:39:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:21,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:21,939 INFO L134 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:39:21,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:21,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:39:21,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:21,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:39:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:39:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:39:21,941 INFO L87 Difference]: Start difference. First operand 949 states and 1344 transitions. Second operand 6 states. [2019-09-10 07:39:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,019 INFO L93 Difference]: Finished difference Result 1680 states and 2341 transitions. [2019-09-10 07:39:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:39:22,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 07:39:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,028 INFO L225 Difference]: With dead ends: 1680 [2019-09-10 07:39:22,028 INFO L226 Difference]: Without dead ends: 1680 [2019-09-10 07:39:22,028 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:39:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2019-09-10 07:39:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 973. [2019-09-10 07:39:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-10 07:39:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1364 transitions. [2019-09-10 07:39:22,063 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1364 transitions. Word has length 78 [2019-09-10 07:39:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,063 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1364 transitions. [2019-09-10 07:39:22,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:39:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1364 transitions. [2019-09-10 07:39:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:39:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,065 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2117428995, now seen corresponding path program 1 times [2019-09-10 07:39:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:22,166 INFO L134 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:39:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:39:22,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:22,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:39:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:39:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:39:22,170 INFO L87 Difference]: Start difference. First operand 973 states and 1364 transitions. Second operand 7 states. [2019-09-10 07:39:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,504 INFO L93 Difference]: Finished difference Result 2077 states and 2873 transitions. [2019-09-10 07:39:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:39:22,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-09-10 07:39:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,514 INFO L225 Difference]: With dead ends: 2077 [2019-09-10 07:39:22,514 INFO L226 Difference]: Without dead ends: 2077 [2019-09-10 07:39:22,515 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:39:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2019-09-10 07:39:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1253. [2019-09-10 07:39:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-10 07:39:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1738 transitions. [2019-09-10 07:39:22,557 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1738 transitions. Word has length 78 [2019-09-10 07:39:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,557 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 1738 transitions. [2019-09-10 07:39:22,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:39:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1738 transitions. [2019-09-10 07:39:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:39:22,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,559 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 694564540, now seen corresponding path program 1 times [2019-09-10 07:39:22,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:22,607 INFO L134 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:39:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:22,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:22,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:22,609 INFO L87 Difference]: Start difference. First operand 1253 states and 1738 transitions. Second operand 3 states. [2019-09-10 07:39:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,633 INFO L93 Difference]: Finished difference Result 1759 states and 2405 transitions. [2019-09-10 07:39:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:22,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:39:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,641 INFO L225 Difference]: With dead ends: 1759 [2019-09-10 07:39:22,642 INFO L226 Difference]: Without dead ends: 1759 [2019-09-10 07:39:22,642 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:39:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-09-10 07:39:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1266. [2019-09-10 07:39:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-09-10 07:39:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1740 transitions. [2019-09-10 07:39:22,678 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1740 transitions. Word has length 79 [2019-09-10 07:39:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,678 INFO L475 AbstractCegarLoop]: Abstraction has 1266 states and 1740 transitions. [2019-09-10 07:39:22,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1740 transitions. [2019-09-10 07:39:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:39:22,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,680 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1702117812, now seen corresponding path program 1 times [2019-09-10 07:39:22,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:22,735 INFO L134 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:39:22,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:22,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:22,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:22,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:22,737 INFO L87 Difference]: Start difference. First operand 1266 states and 1740 transitions. Second operand 3 states. [2019-09-10 07:39:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,757 INFO L93 Difference]: Finished difference Result 1486 states and 1992 transitions. [2019-09-10 07:39:22,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:22,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:39:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,764 INFO L225 Difference]: With dead ends: 1486 [2019-09-10 07:39:22,764 INFO L226 Difference]: Without dead ends: 1486 [2019-09-10 07:39:22,764 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:39:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2019-09-10 07:39:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1166. [2019-09-10 07:39:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-09-10 07:39:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1565 transitions. [2019-09-10 07:39:22,795 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1565 transitions. Word has length 80 [2019-09-10 07:39:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,796 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1565 transitions. [2019-09-10 07:39:22,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1565 transitions. [2019-09-10 07:39:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:39:22,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,797 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash -68913520, now seen corresponding path program 1 times [2019-09-10 07:39:22,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:22,850 INFO L134 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:39:22,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:22,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:39:22,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:22,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:39:22,852 INFO L87 Difference]: Start difference. First operand 1166 states and 1565 transitions. Second operand 3 states. [2019-09-10 07:39:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:22,878 INFO L93 Difference]: Finished difference Result 1308 states and 1737 transitions. [2019-09-10 07:39:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:22,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:39:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:22,884 INFO L225 Difference]: With dead ends: 1308 [2019-09-10 07:39:22,884 INFO L226 Difference]: Without dead ends: 1308 [2019-09-10 07:39:22,885 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:39:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-10 07:39:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1266. [2019-09-10 07:39:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-09-10 07:39:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1686 transitions. [2019-09-10 07:39:22,912 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1686 transitions. Word has length 81 [2019-09-10 07:39:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:22,912 INFO L475 AbstractCegarLoop]: Abstraction has 1266 states and 1686 transitions. [2019-09-10 07:39:22,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1686 transitions. [2019-09-10 07:39:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:39:22,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:22,914 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] [2019-09-10 07:39:22,914 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1536851179, now seen corresponding path program 1 times [2019-09-10 07:39:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:22,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:22,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:22,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,015 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:39:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:23,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:23,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:23,017 INFO L87 Difference]: Start difference. First operand 1266 states and 1686 transitions. Second operand 5 states. [2019-09-10 07:39:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:23,093 INFO L93 Difference]: Finished difference Result 3778 states and 5035 transitions. [2019-09-10 07:39:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:23,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 07:39:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:23,110 INFO L225 Difference]: With dead ends: 3778 [2019-09-10 07:39:23,110 INFO L226 Difference]: Without dead ends: 3778 [2019-09-10 07:39:23,110 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:39:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2019-09-10 07:39:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2136. [2019-09-10 07:39:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2019-09-10 07:39:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2846 transitions. [2019-09-10 07:39:23,167 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2846 transitions. Word has length 100 [2019-09-10 07:39:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:23,168 INFO L475 AbstractCegarLoop]: Abstraction has 2136 states and 2846 transitions. [2019-09-10 07:39:23,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2846 transitions. [2019-09-10 07:39:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:39:23,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:23,170 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] [2019-09-10 07:39:23,170 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2143438101, now seen corresponding path program 1 times [2019-09-10 07:39:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:23,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:39:23,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:23,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:23,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:23,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:23,249 INFO L87 Difference]: Start difference. First operand 2136 states and 2846 transitions. Second operand 5 states. [2019-09-10 07:39:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:23,329 INFO L93 Difference]: Finished difference Result 4684 states and 6246 transitions. [2019-09-10 07:39:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:23,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 07:39:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:23,349 INFO L225 Difference]: With dead ends: 4684 [2019-09-10 07:39:23,349 INFO L226 Difference]: Without dead ends: 4684 [2019-09-10 07:39:23,352 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:39:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-09-10 07:39:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 3421. [2019-09-10 07:39:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3421 states. [2019-09-10 07:39:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4554 transitions. [2019-09-10 07:39:23,460 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4554 transitions. Word has length 100 [2019-09-10 07:39:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:23,460 INFO L475 AbstractCegarLoop]: Abstraction has 3421 states and 4554 transitions. [2019-09-10 07:39:23,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4554 transitions. [2019-09-10 07:39:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:39:23,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:23,462 INFO L399 BasicCegarLoop]: trace histogram [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:39:23,463 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:23,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1776610354, now seen corresponding path program 1 times [2019-09-10 07:39:23,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:23,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:23,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:39:23,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:23,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:39:23,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:23,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:39:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:39:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:39:23,539 INFO L87 Difference]: Start difference. First operand 3421 states and 4554 transitions. Second operand 5 states. [2019-09-10 07:39:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:23,605 INFO L93 Difference]: Finished difference Result 4346 states and 5785 transitions. [2019-09-10 07:39:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:39:23,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:39:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:23,625 INFO L225 Difference]: With dead ends: 4346 [2019-09-10 07:39:23,625 INFO L226 Difference]: Without dead ends: 4346 [2019-09-10 07:39:23,625 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:39:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-09-10 07:39:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 3876. [2019-09-10 07:39:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2019-09-10 07:39:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 5166 transitions. [2019-09-10 07:39:23,701 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 5166 transitions. Word has length 101 [2019-09-10 07:39:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:23,703 INFO L475 AbstractCegarLoop]: Abstraction has 3876 states and 5166 transitions. [2019-09-10 07:39:23,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:39:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 5166 transitions. [2019-09-10 07:39:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:39:23,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:23,706 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:39:23,707 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1162299485, now seen corresponding path program 1 times [2019-09-10 07:39:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:23,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:23,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:23,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:39:23,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 07:39:23,967 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [650], [804], [807], [811], [814], [817], [821], [823], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:39:24,013 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:39:24,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:39:24,144 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:39:24,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:39:24,567 INFO L272 AbstractInterpreter]: Visited 90 different actions 301 times. Merged at 34 different actions 188 times. Widened at 9 different actions 19 times. Performed 1089 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1089 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 18 fixpoints after 7 different actions. Largest state had 134 variables. [2019-09-10 07:39:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:24,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:39:24,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:24,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:39:24,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:24,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:39:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:39:24,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:39:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:24,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:39:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:39:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 13 [2019-09-10 07:39:24,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:24,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:39:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:39:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:39:24,823 INFO L87 Difference]: Start difference. First operand 3876 states and 5166 transitions. Second operand 3 states. [2019-09-10 07:39:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:24,861 INFO L93 Difference]: Finished difference Result 3485 states and 4501 transitions. [2019-09-10 07:39:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:39:24,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:39:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:24,875 INFO L225 Difference]: With dead ends: 3485 [2019-09-10 07:39:24,875 INFO L226 Difference]: Without dead ends: 3485 [2019-09-10 07:39:24,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:39:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2019-09-10 07:39:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3483. [2019-09-10 07:39:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3483 states. [2019-09-10 07:39:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4500 transitions. [2019-09-10 07:39:24,941 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4500 transitions. Word has length 102 [2019-09-10 07:39:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:24,941 INFO L475 AbstractCegarLoop]: Abstraction has 3483 states and 4500 transitions. [2019-09-10 07:39:24,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:39:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4500 transitions. [2019-09-10 07:39:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:39:24,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:24,943 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] [2019-09-10 07:39:24,944 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 238429009, now seen corresponding path program 1 times [2019-09-10 07:39:24,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:24,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:24,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:24,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:24,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 07:39:25,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:39:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:39:25,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:39:25,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:39:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:39:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:39:25,085 INFO L87 Difference]: Start difference. First operand 3483 states and 4500 transitions. Second operand 9 states. [2019-09-10 07:39:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:39:25,615 INFO L93 Difference]: Finished difference Result 7074 states and 9104 transitions. [2019-09-10 07:39:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:39:25,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 07:39:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:39:25,630 INFO L225 Difference]: With dead ends: 7074 [2019-09-10 07:39:25,630 INFO L226 Difference]: Without dead ends: 7074 [2019-09-10 07:39:25,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:39:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7074 states. [2019-09-10 07:39:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7074 to 3483. [2019-09-10 07:39:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3483 states. [2019-09-10 07:39:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4499 transitions. [2019-09-10 07:39:25,711 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4499 transitions. Word has length 102 [2019-09-10 07:39:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:39:25,712 INFO L475 AbstractCegarLoop]: Abstraction has 3483 states and 4499 transitions. [2019-09-10 07:39:25,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:39:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4499 transitions. [2019-09-10 07:39:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:39:25,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:39:25,714 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] [2019-09-10 07:39:25,714 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:39:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1663300300, now seen corresponding path program 1 times [2019-09-10 07:39:25,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:39:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:25,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:39:25,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:39:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:26,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:26,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:39:26,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 07:39:26,055 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [848], [850], [852], [855], [870], [872], [874], [877], [892], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:39:26,069 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:39:26,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:39:26,111 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:39:26,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:39:26,600 INFO L272 AbstractInterpreter]: Visited 97 different actions 497 times. Merged at 38 different actions 343 times. Widened at 16 different actions 54 times. Performed 1644 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1644 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 16 different actions. Largest state had 134 variables. [2019-09-10 07:39:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:39:26,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:39:26,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:39:26,601 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:39:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:39:26,630 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:39:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:39:26,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:39:26,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:39:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:27,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:39:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:28,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:28,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:28,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:39:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:39:29,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:39:29,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:39:29,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:39:29,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:39:29,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:39:29,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:39:29,881 INFO L87 Difference]: Start difference. First operand 3483 states and 4499 transitions. Second operand 21 states. [2019-09-10 07:39:31,582 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:39:32,149 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:39:32,442 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:39:33,234 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:39:33,544 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:39:33,761 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:39:35,952 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:39:36,290 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:39:36,538 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:39:36,796 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:39:37,470 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:39:37,926 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:39:38,193 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:39:38,460 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:39:38,837 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:39:39,139 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:39:39,357 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:39:39,613 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:39:39,901 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:39:40,236 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:39:40,541 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:39:41,311 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:39:41,777 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:39:42,015 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:39:43,367 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:39:43,729 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:39:44,096 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:39:45,251 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:39:45,587 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:39:46,147 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:39:46,524 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:39:47,078 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:39:47,352 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:39:47,854 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:39:48,536 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:39:49,583 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:39:50,016 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:39:50,276 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:39:50,681 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:39:52,773 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:39:53,295 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:39:54,748 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:39:55,018 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:39:55,386 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:39:55,828 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:39:56,104 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:39:56,519 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:39:57,263 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:39:57,585 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:39:57,894 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 07:39:58,161 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:39:58,426 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:39:58,735 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:39:58,987 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:39:59,583 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:40:00,259 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:40:00,563 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:40:03,077 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:40:03,417 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:40:03,806 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:40:04,229 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:04,715 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:40:05,974 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:06,829 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:40:07,457 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 07:40:07,924 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:40:08,403 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:40:08,807 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:40:09,193 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:09,436 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:40:10,282 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:40:10,884 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:40:11,318 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:40:11,797 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:40:12,148 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:12,527 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:12,936 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:40:13,275 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:40:13,651 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:40:14,005 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:40:14,606 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:40:15,009 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:15,378 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:40:15,697 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:40:16,061 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-09-10 07:40:16,800 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:40:17,113 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:40:17,538 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:40:17,965 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:40:18,275 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:40:18,729 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:40:19,061 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 07:40:19,354 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:40:19,579 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:40:20,075 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:40:20,449 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:40:20,912 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:40:21,140 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:40:21,588 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:40:21,948 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:40:22,209 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:40:22,461 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:40:22,657 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:40:22,857 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:40:26,896 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:40:27,298 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:40:27,613 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:40:28,078 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:40:28,812 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:40:29,654 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:40:32,027 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:40:32,975 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:40:33,209 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:40:33,519 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:40:33,826 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:34,085 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:40:34,463 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:40:35,445 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:40:35,935 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:36,452 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:40:37,082 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:40:37,472 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:40:37,663 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:40:38,142 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:40:38,779 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:40:39,185 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:40:39,442 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:40:39,742 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:40,214 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:40:41,019 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:40:41,582 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:40:41,981 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:40:42,419 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:40:43,090 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:40:45,869 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:40:46,090 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:40:46,676 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:47,143 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:40:47,465 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:40:47,706 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:40:48,062 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:48,537 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:40:49,098 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:40:49,501 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:40:49,951 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:40:50,343 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:40:50,640 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:51,189 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:40:51,711 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:40:52,030 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:40:52,777 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:40:53,292 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:40:53,919 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:40:54,483 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:40:54,894 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:40:55,492 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:40:55,902 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:40:56,446 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:40:57,036 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:40:57,493 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:40:58,153 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:40:59,463 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:40:59,647 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:40:59,965 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:41:00,218 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:41:00,471 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:41:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:00,503 INFO L93 Difference]: Finished difference Result 53533 states and 67214 transitions. [2019-09-10 07:41:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-09-10 07:41:00,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-09-10 07:41:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:00,612 INFO L225 Difference]: With dead ends: 53533 [2019-09-10 07:41:00,612 INFO L226 Difference]: Without dead ends: 53533 [2019-09-10 07:41:00,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 161 SyntacticMatches, 29 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15624 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=7670, Invalid=36220, Unknown=0, NotChecked=0, Total=43890 [2019-09-10 07:41:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53533 states. [2019-09-10 07:41:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53533 to 17661. [2019-09-10 07:41:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17661 states. [2019-09-10 07:41:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17661 states to 17661 states and 22735 transitions. [2019-09-10 07:41:01,080 INFO L78 Accepts]: Start accepts. Automaton has 17661 states and 22735 transitions. Word has length 104 [2019-09-10 07:41:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:01,081 INFO L475 AbstractCegarLoop]: Abstraction has 17661 states and 22735 transitions. [2019-09-10 07:41:01,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:41:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17661 states and 22735 transitions. [2019-09-10 07:41:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:41:01,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:01,086 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:41:01,086 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1587740804, now seen corresponding path program 1 times [2019-09-10 07:41:01,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:01,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:01,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:01,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:01,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:41:01,327 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:41:01,335 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:01,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:01,365 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:01,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:01,700 INFO L272 AbstractInterpreter]: Visited 99 different actions 408 times. Merged at 41 different actions 274 times. Widened at 11 different actions 34 times. Performed 1410 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1410 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 8 different actions. Largest state had 134 variables. [2019-09-10 07:41:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:01,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:01,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:01,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:01,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:01,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:41:01,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:01,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:02,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:02,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:02,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:41:04,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:04,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:41:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:41:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:41:04,247 INFO L87 Difference]: Start difference. First operand 17661 states and 22735 transitions. Second operand 18 states. [2019-09-10 07:41:04,936 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:41:05,180 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:41:05,782 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:41:06,522 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:41:06,886 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:41:07,149 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:41:07,396 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:41:07,633 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:41:08,018 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:41:08,778 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:41:09,121 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:41:09,492 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 07:41:09,864 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:41:10,318 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:41:10,633 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 07:41:11,062 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 07:41:11,367 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-10 07:41:11,608 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:41:12,022 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:41:12,243 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:41:12,442 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:41:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:12,577 INFO L93 Difference]: Finished difference Result 75715 states and 96559 transitions. [2019-09-10 07:41:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:41:12,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2019-09-10 07:41:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:12,703 INFO L225 Difference]: With dead ends: 75715 [2019-09-10 07:41:12,704 INFO L226 Difference]: Without dead ends: 75715 [2019-09-10 07:41:12,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 25 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=713, Invalid=2479, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:41:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75715 states. [2019-09-10 07:41:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75715 to 42679. [2019-09-10 07:41:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-09-10 07:41:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 54842 transitions. [2019-09-10 07:41:13,563 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 54842 transitions. Word has length 105 [2019-09-10 07:41:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:13,563 INFO L475 AbstractCegarLoop]: Abstraction has 42679 states and 54842 transitions. [2019-09-10 07:41:13,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:41:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 54842 transitions. [2019-09-10 07:41:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:13,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:13,573 INFO L399 BasicCegarLoop]: trace histogram [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:41:13,574 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:13,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1674308692, now seen corresponding path program 1 times [2019-09-10 07:41:13,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:13,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:13,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:13,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:13,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:41:13,772 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:41:13,777 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:13,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:13,791 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:14,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:14,061 INFO L272 AbstractInterpreter]: Visited 100 different actions 389 times. Merged at 41 different actions 255 times. Widened at 11 different actions 27 times. Performed 1354 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1354 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 134 variables. [2019-09-10 07:41:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:14,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:14,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:14,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:14,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:14,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:41:14,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:14,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:14,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,280 WARN L188 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-09-10 07:41:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:15,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:15,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:16,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:16,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:41:16,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:16,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:41:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:41:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:41:16,294 INFO L87 Difference]: Start difference. First operand 42679 states and 54842 transitions. Second operand 20 states. [2019-09-10 07:41:21,897 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:41:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:23,628 INFO L93 Difference]: Finished difference Result 134793 states and 171882 transitions. [2019-09-10 07:41:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 07:41:23,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:41:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:23,795 INFO L225 Difference]: With dead ends: 134793 [2019-09-10 07:41:23,795 INFO L226 Difference]: Without dead ends: 134793 [2019-09-10 07:41:23,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 13 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1675, Invalid=6881, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 07:41:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134793 states. [2019-09-10 07:41:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134793 to 42633. [2019-09-10 07:41:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42633 states. [2019-09-10 07:41:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42633 states to 42633 states and 54793 transitions. [2019-09-10 07:41:24,936 INFO L78 Accepts]: Start accepts. Automaton has 42633 states and 54793 transitions. Word has length 106 [2019-09-10 07:41:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:24,936 INFO L475 AbstractCegarLoop]: Abstraction has 42633 states and 54793 transitions. [2019-09-10 07:41:24,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42633 states and 54793 transitions. [2019-09-10 07:41:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:41:24,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:24,947 INFO L399 BasicCegarLoop]: trace histogram [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:41:24,950 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:24,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1252556774, now seen corresponding path program 1 times [2019-09-10 07:41:24,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:24,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:24,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:25,219 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-09-10 07:41:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:25,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:25,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:25,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:41:25,372 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [848], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:41:25,376 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:25,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:25,392 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:25,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:25,567 INFO L272 AbstractInterpreter]: Visited 100 different actions 359 times. Merged at 41 different actions 229 times. Widened at 10 different actions 21 times. Performed 1231 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 8 different actions. Largest state had 134 variables. [2019-09-10 07:41:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:25,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:25,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:41:25,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:25,590 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:41:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:25,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:41:25,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:25,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:25,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:26,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:26,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:26,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:41:27,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 32 [2019-09-10 07:41:27,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:41:27,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:41:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:41:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:41:27,331 INFO L87 Difference]: Start difference. First operand 42633 states and 54793 transitions. Second operand 23 states. [2019-09-10 07:41:27,817 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:41:28,125 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:41:28,303 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 07:41:28,466 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 07:41:28,646 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:41:29,105 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 07:41:29,277 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:41:29,665 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:41:29,827 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:41:30,964 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:41:31,414 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:41:31,738 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:41:31,899 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 07:41:32,074 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:41:32,316 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 07:41:32,491 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-10 07:41:32,742 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 07:41:32,904 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:41:33,114 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-09-10 07:41:33,325 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-09-10 07:41:33,535 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 07:41:34,679 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2019-09-10 07:41:35,303 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-09-10 07:41:35,850 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:41:36,688 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-09-10 07:41:37,276 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:41:37,660 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:41:38,047 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:41:38,474 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:41:38,630 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:41:38,768 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:41:38,941 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 07:41:39,260 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 07:41:39,547 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-10 07:41:39,741 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:41:39,893 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 07:41:40,241 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-09-10 07:41:40,530 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:41:40,926 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:41:41,383 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 07:41:41,768 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 07:41:42,011 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:41:42,226 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:41:42,393 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 07:41:42,553 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:41:43,075 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-10 07:41:43,207 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:41:43,371 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:41:43,510 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:41:43,685 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:41:43,883 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:41:44,108 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 07:41:44,337 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:41:44,523 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:41:44,793 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:41:44,942 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:41:45,118 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:41:45,287 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 07:41:45,462 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:41:45,670 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 07:41:45,831 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:41:46,065 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:41:46,247 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:41:46,434 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:41:46,626 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 07:41:47,071 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 07:41:47,230 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:41:47,397 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:41:47,587 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 07:41:47,756 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:41:47,954 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 07:41:48,167 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-09-10 07:41:48,406 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 07:41:49,096 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:41:49,407 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:41:50,818 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:41:51,285 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:41:52,704 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:41:52,907 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:41:53,375 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:41:53,744 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:41:53,941 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:41:54,440 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:41:54,635 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:41:55,352 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:41:55,768 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:41:55,918 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:41:56,188 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 07:41:56,376 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:41:56,712 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:41:56,931 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 07:41:57,112 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:41:57,305 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 07:41:57,549 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:41:57,801 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:41:58,052 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-10 07:41:58,257 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:41:59,735 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:42:01,117 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:42:02,093 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:42:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:02,285 INFO L93 Difference]: Finished difference Result 211246 states and 266395 transitions. [2019-09-10 07:42:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-09-10 07:42:02,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2019-09-10 07:42:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:02,555 INFO L225 Difference]: With dead ends: 211246 [2019-09-10 07:42:02,555 INFO L226 Difference]: Without dead ends: 211246 [2019-09-10 07:42:02,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 172 SyntacticMatches, 23 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26835 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=11302, Invalid=53468, Unknown=0, NotChecked=0, Total=64770 [2019-09-10 07:42:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211246 states. [2019-09-10 07:42:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211246 to 65834. [2019-09-10 07:42:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65834 states. [2019-09-10 07:42:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65834 states to 65834 states and 84877 transitions. [2019-09-10 07:42:03,906 INFO L78 Accepts]: Start accepts. Automaton has 65834 states and 84877 transitions. Word has length 106 [2019-09-10 07:42:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:03,906 INFO L475 AbstractCegarLoop]: Abstraction has 65834 states and 84877 transitions. [2019-09-10 07:42:03,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:42:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 65834 states and 84877 transitions. [2019-09-10 07:42:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:42:03,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:03,913 INFO L399 BasicCegarLoop]: trace histogram [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:42:03,914 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1341809353, now seen corresponding path program 1 times [2019-09-10 07:42:03,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:03,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:03,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:03,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:03,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:04,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:04,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:04,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:42:04,234 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:42:04,236 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:04,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:04,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:04,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:04,443 INFO L272 AbstractInterpreter]: Visited 100 different actions 387 times. Merged at 42 different actions 257 times. Widened at 11 different actions 26 times. Performed 1377 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1377 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 134 variables. [2019-09-10 07:42:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:04,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:04,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:04,444 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:42:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:04,471 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:42:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:04,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 07:42:04,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:04,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:04,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:05,182 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-09-10 07:42:05,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:42:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:42:05,847 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 07:42:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:06,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:07,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:08,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:09,728 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 07:42:09,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:42:09,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:10,899 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-09-10 07:42:12,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:42:12,884 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 63 [2019-09-10 07:42:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 54 [2019-09-10 07:42:13,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:13,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:42:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:42:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2649, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:42:13,370 INFO L87 Difference]: Start difference. First operand 65834 states and 84877 transitions. Second operand 35 states. [2019-09-10 07:42:13,697 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 07:42:14,470 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:42:14,768 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 07:42:15,114 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 07:42:18,354 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:42:19,019 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:20,133 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:21,306 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:42:23,150 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:42:24,007 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:26,176 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:42:27,015 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:42:27,521 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:42:27,766 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:42:28,287 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:42:30,062 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:42:30,514 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:30,714 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:42:31,419 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:42:32,728 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:42:33,320 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:42:34,960 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:42:36,048 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:42:36,962 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:42:37,784 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:42:42,268 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:42:42,661 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:42:43,344 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:42:45,355 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:42:47,325 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:42:47,637 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:42:48,667 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:42:49,459 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:42:49,792 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:42:50,585 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:51,092 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:42:51,826 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:42:55,103 WARN L188 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:42:55,501 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:42:55,873 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:42:56,100 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:42:57,500 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:42:57,829 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:42:58,505 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:42:59,505 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:43:00,344 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:43:00,978 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:43:01,346 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:43:01,843 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:43:03,151 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:43:04,948 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:43:05,441 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:43:06,606 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 07:43:10,236 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:43:11,073 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 07:43:12,139 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:43:13,186 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:43:13,720 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:43:14,276 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:43:14,903 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:43:16,784 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:43:18,037 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:43:20,885 WARN L188 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:43:21,983 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:43:24,562 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:43:25,170 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:43:26,383 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 07:43:27,611 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:43:29,129 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 07:43:29,615 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 07:43:31,096 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 07:43:33,725 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:43:35,009 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:43:35,346 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 07:43:36,133 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-10 07:43:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:36,634 INFO L93 Difference]: Finished difference Result 276209 states and 351503 transitions. [2019-09-10 07:43:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-09-10 07:43:36,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2019-09-10 07:43:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:36,953 INFO L225 Difference]: With dead ends: 276209 [2019-09-10 07:43:36,953 INFO L226 Difference]: Without dead ends: 276209 [2019-09-10 07:43:36,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 152 SyntacticMatches, 24 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28605 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=8470, Invalid=67982, Unknown=0, NotChecked=0, Total=76452 [2019-09-10 07:43:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276209 states. [2019-09-10 07:43:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276209 to 116580. [2019-09-10 07:43:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116580 states. [2019-09-10 07:43:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116580 states to 116580 states and 150283 transitions. [2019-09-10 07:43:39,169 INFO L78 Accepts]: Start accepts. Automaton has 116580 states and 150283 transitions. Word has length 106 [2019-09-10 07:43:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:39,169 INFO L475 AbstractCegarLoop]: Abstraction has 116580 states and 150283 transitions. [2019-09-10 07:43:39,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:43:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 116580 states and 150283 transitions. [2019-09-10 07:43:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:43:39,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:39,180 INFO L399 BasicCegarLoop]: trace histogram [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:43:39,180 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 788386607, now seen corresponding path program 1 times [2019-09-10 07:43:39,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:39,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:39,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:39,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:39,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:39,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:43:39,390 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [863], [866], [872], [874], [877], [892], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:43:39,393 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:39,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:39,408 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:43:39,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:43:39,620 INFO L272 AbstractInterpreter]: Visited 100 different actions 420 times. Merged at 41 different actions 282 times. Widened at 13 different actions 39 times. Performed 1492 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1492 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 13 different actions. Largest state had 134 variables. [2019-09-10 07:43:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:39,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:43:39,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:39,621 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:43:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:39,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:43:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:39,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:43:39,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:43:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:39,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:40,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:43:40,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:40,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:43:40,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:43:40,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:43:40,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:43:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:43:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:43:40,895 INFO L87 Difference]: Start difference. First operand 116580 states and 150283 transitions. Second operand 20 states. [2019-09-10 07:43:48,752 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:43:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:54,467 INFO L93 Difference]: Finished difference Result 326890 states and 411347 transitions. [2019-09-10 07:43:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 07:43:54,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:43:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:54,856 INFO L225 Difference]: With dead ends: 326890 [2019-09-10 07:43:54,856 INFO L226 Difference]: Without dead ends: 326890 [2019-09-10 07:43:54,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7531 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3712, Invalid=17750, Unknown=0, NotChecked=0, Total=21462 [2019-09-10 07:43:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326890 states. [2019-09-10 07:43:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326890 to 116564. [2019-09-10 07:43:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116564 states. [2019-09-10 07:43:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116564 states to 116564 states and 150267 transitions. [2019-09-10 07:43:57,207 INFO L78 Accepts]: Start accepts. Automaton has 116564 states and 150267 transitions. Word has length 106 [2019-09-10 07:43:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:57,207 INFO L475 AbstractCegarLoop]: Abstraction has 116564 states and 150267 transitions. [2019-09-10 07:43:57,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:43:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116564 states and 150267 transitions. [2019-09-10 07:43:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:43:57,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:57,214 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:57,214 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1418661840, now seen corresponding path program 1 times [2019-09-10 07:43:57,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:57,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:57,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:57,267 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:43:57,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:57,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:43:57,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:57,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:43:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:43:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:43:57,269 INFO L87 Difference]: Start difference. First operand 116564 states and 150267 transitions. Second operand 3 states. [2019-09-10 07:43:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:57,421 INFO L93 Difference]: Finished difference Result 61683 states and 77469 transitions. [2019-09-10 07:43:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:43:57,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 07:43:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:57,497 INFO L225 Difference]: With dead ends: 61683 [2019-09-10 07:43:57,497 INFO L226 Difference]: Without dead ends: 61683 [2019-09-10 07:43:57,497 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:43:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61683 states. [2019-09-10 07:43:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61683 to 60601. [2019-09-10 07:43:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60601 states. [2019-09-10 07:43:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60601 states to 60601 states and 76388 transitions. [2019-09-10 07:43:58,027 INFO L78 Accepts]: Start accepts. Automaton has 60601 states and 76388 transitions. Word has length 107 [2019-09-10 07:43:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:58,028 INFO L475 AbstractCegarLoop]: Abstraction has 60601 states and 76388 transitions. [2019-09-10 07:43:58,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:43:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 60601 states and 76388 transitions. [2019-09-10 07:43:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:43:58,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:58,033 INFO L399 BasicCegarLoop]: trace histogram [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:43:58,033 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2092671789, now seen corresponding path program 1 times [2019-09-10 07:43:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:58,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:58,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:58,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:58,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:43:58,510 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:43:58,511 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:58,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:58,525 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:00,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:00,605 INFO L272 AbstractInterpreter]: Visited 101 different actions 348 times. Merged at 42 different actions 219 times. Widened at 9 different actions 14 times. Performed 1214 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 134 variables. [2019-09-10 07:44:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:00,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:00,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:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:00,621 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:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:00,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:44:00,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:00,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:00,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:00,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:01,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:01,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2019-09-10 07:44:01,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:01,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:44:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:44:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:44:01,297 INFO L87 Difference]: Start difference. First operand 60601 states and 76388 transitions. Second operand 21 states. [2019-09-10 07:44:05,051 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:44:05,213 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 07:44:05,425 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-09-10 07:44:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:06,062 INFO L93 Difference]: Finished difference Result 146016 states and 182780 transitions. [2019-09-10 07:44:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 07:44:06,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-10 07:44:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:06,207 INFO L225 Difference]: With dead ends: 146016 [2019-09-10 07:44:06,207 INFO L226 Difference]: Without dead ends: 146016 [2019-09-10 07:44:06,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=966, Invalid=3726, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 07:44:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146016 states. [2019-09-10 07:44:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146016 to 76935. [2019-09-10 07:44:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76935 states. [2019-09-10 07:44:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76935 states to 76935 states and 97073 transitions. [2019-09-10 07:44:07,182 INFO L78 Accepts]: Start accepts. Automaton has 76935 states and 97073 transitions. Word has length 107 [2019-09-10 07:44:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:07,183 INFO L475 AbstractCegarLoop]: Abstraction has 76935 states and 97073 transitions. [2019-09-10 07:44:07,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76935 states and 97073 transitions. [2019-09-10 07:44:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:44:07,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:07,188 INFO L399 BasicCegarLoop]: trace histogram [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:44:07,188 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1841941927, now seen corresponding path program 1 times [2019-09-10 07:44:07,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:07,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:07,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:07,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:44:07,897 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:44:07,899 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:07,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:07,912 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:08,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:08,137 INFO L272 AbstractInterpreter]: Visited 101 different actions 439 times. Merged at 42 different actions 302 times. Widened at 12 different actions 38 times. Performed 1538 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1538 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:44:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:08,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:08,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:08,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:08,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:08,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 07:44:08,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:08,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:08,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:09,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:44:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:11,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:11,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 54 [2019-09-10 07:44:11,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:11,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:44:11,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:44:11,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2620, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:44:11,187 INFO L87 Difference]: Start difference. First operand 76935 states and 97073 transitions. Second operand 36 states. [2019-09-10 07:44:11,386 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:44:21,685 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:44:21,978 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:44:25,076 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:44:25,645 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:44:26,705 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:44:32,585 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:44:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:39,299 INFO L93 Difference]: Finished difference Result 189447 states and 236843 transitions. [2019-09-10 07:44:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-10 07:44:39,299 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2019-09-10 07:44:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:39,775 INFO L225 Difference]: With dead ends: 189447 [2019-09-10 07:44:39,775 INFO L226 Difference]: Without dead ends: 189447 [2019-09-10 07:44:39,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 172 SyntacticMatches, 7 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11787 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=5329, Invalid=34073, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 07:44:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189447 states. [2019-09-10 07:44:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189447 to 100442. [2019-09-10 07:44:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100442 states. [2019-09-10 07:44:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100442 states to 100442 states and 126492 transitions. [2019-09-10 07:44:40,938 INFO L78 Accepts]: Start accepts. Automaton has 100442 states and 126492 transitions. Word has length 107 [2019-09-10 07:44:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 100442 states and 126492 transitions. [2019-09-10 07:44:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:44:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 100442 states and 126492 transitions. [2019-09-10 07:44:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:44:40,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:40,947 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:40,947 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1825088371, now seen corresponding path program 1 times [2019-09-10 07:44:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:40,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:44:40,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:44:40,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:44:40,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:44:40,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:44:40,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:44:40,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:40,997 INFO L87 Difference]: Start difference. First operand 100442 states and 126492 transitions. Second operand 3 states. [2019-09-10 07:44:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:41,168 INFO L93 Difference]: Finished difference Result 67749 states and 83994 transitions. [2019-09-10 07:44:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:44:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 07:44:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:41,229 INFO L225 Difference]: With dead ends: 67749 [2019-09-10 07:44:41,229 INFO L226 Difference]: Without dead ends: 67749 [2019-09-10 07:44:41,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:44:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67749 states. [2019-09-10 07:44:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67749 to 67749. [2019-09-10 07:44:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67749 states. [2019-09-10 07:44:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67749 states to 67749 states and 83994 transitions. [2019-09-10 07:44:41,821 INFO L78 Accepts]: Start accepts. Automaton has 67749 states and 83994 transitions. Word has length 107 [2019-09-10 07:44:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:41,821 INFO L475 AbstractCegarLoop]: Abstraction has 67749 states and 83994 transitions. [2019-09-10 07:44:41,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:44:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 67749 states and 83994 transitions. [2019-09-10 07:44:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:44:41,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:41,826 INFO L399 BasicCegarLoop]: trace histogram [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:44:41,827 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1723514340, now seen corresponding path program 1 times [2019-09-10 07:44:41,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:41,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:41,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:41,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:42,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:42,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:42,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:44:42,405 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:44:42,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:42,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:42,423 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:42,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:42,628 INFO L272 AbstractInterpreter]: Visited 101 different actions 391 times. Merged at 42 different actions 259 times. Widened at 12 different actions 27 times. Performed 1359 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1359 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:44:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:42,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:42,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:42,629 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:44:42,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:42,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:42,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:44:42,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:42,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:42,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:43,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:45,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2019-09-10 07:44:45,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:45,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:44:45,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:44:45,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:44:45,182 INFO L87 Difference]: Start difference. First operand 67749 states and 83994 transitions. Second operand 22 states. [2019-09-10 07:44:46,448 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 21 [2019-09-10 07:44:46,633 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:44:46,803 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 30 [2019-09-10 07:44:47,010 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:47,213 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 30 [2019-09-10 07:44:47,427 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:47,959 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:44:48,221 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2019-09-10 07:44:48,487 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:44:48,723 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2019-09-10 07:44:48,982 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 28 [2019-09-10 07:44:49,219 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:44:49,538 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:44:49,894 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:50,193 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:44:50,445 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2019-09-10 07:44:50,687 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:44:50,924 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:51,310 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:44:51,624 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:44:52,088 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2019-09-10 07:44:52,401 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:44:52,729 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 07:44:53,077 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2019-09-10 07:44:53,292 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2019-09-10 07:44:53,715 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-09-10 07:44:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:53,777 INFO L93 Difference]: Finished difference Result 95858 states and 116905 transitions. [2019-09-10 07:44:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 07:44:53,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-09-10 07:44:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:44:53,886 INFO L225 Difference]: With dead ends: 95858 [2019-09-10 07:44:53,887 INFO L226 Difference]: Without dead ends: 95858 [2019-09-10 07:44:53,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1326, Invalid=4526, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 07:44:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95858 states. [2019-09-10 07:44:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95858 to 62722. [2019-09-10 07:44:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62722 states. [2019-09-10 07:44:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62722 states to 62722 states and 77680 transitions. [2019-09-10 07:44:54,700 INFO L78 Accepts]: Start accepts. Automaton has 62722 states and 77680 transitions. Word has length 107 [2019-09-10 07:44:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:54,700 INFO L475 AbstractCegarLoop]: Abstraction has 62722 states and 77680 transitions. [2019-09-10 07:44:54,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:44:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 62722 states and 77680 transitions. [2019-09-10 07:44:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:44:54,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:54,705 INFO L399 BasicCegarLoop]: trace histogram [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:44:54,705 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1366634664, now seen corresponding path program 1 times [2019-09-10 07:44:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:54,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:54,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:55,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:55,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:55,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:44:55,043 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:44:55,045 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:55,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:55,058 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:55,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:55,243 INFO L272 AbstractInterpreter]: Visited 101 different actions 451 times. Merged at 42 different actions 312 times. Widened at 12 different actions 41 times. Performed 1510 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:44:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:55,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:55,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:55,244 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) [2019-09-10 07:44:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:55,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:55,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 07:44:55,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:56,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:56,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:57,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:57,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 47 [2019-09-10 07:44:57,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:57,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 07:44:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 07:44:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1962, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:44:57,565 INFO L87 Difference]: Start difference. First operand 62722 states and 77680 transitions. Second operand 33 states. [2019-09-10 07:45:00,331 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:00,591 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:45:01,205 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:02,428 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:45:02,912 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:03,103 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:45:05,514 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:45:05,901 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:06,091 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:06,499 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:45:06,738 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:07,173 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:07,378 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:07,738 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:45:07,966 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:08,353 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:08,570 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:08,975 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:09,228 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:09,643 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:45:10,240 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:45:10,511 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:11,076 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:45:11,367 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 07:45:11,723 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:14,767 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:15,366 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:16,029 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:45:16,458 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 07:45:16,734 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:17,298 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:21,596 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:45:21,883 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:45:24,367 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:45:24,730 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:45:24,995 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:45:25,408 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:26,507 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:45:26,817 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 07:45:27,415 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:45:27,785 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:28,726 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:29,147 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:29,823 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:45:30,515 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:45:31,058 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:45:31,706 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:45:32,081 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:45:32,317 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:45:32,541 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:45:33,053 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:45:33,396 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:35,318 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:45:35,930 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:45:37,096 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:45:39,838 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:40,511 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:45:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:40,588 INFO L93 Difference]: Finished difference Result 101288 states and 124539 transitions. [2019-09-10 07:45:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-10 07:45:40,589 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2019-09-10 07:45:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:40,738 INFO L225 Difference]: With dead ends: 101288 [2019-09-10 07:45:40,739 INFO L226 Difference]: Without dead ends: 101124 [2019-09-10 07:45:40,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11050 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=4314, Invalid=28992, Unknown=0, NotChecked=0, Total=33306 [2019-09-10 07:45:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101124 states. [2019-09-10 07:45:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101124 to 73968. [2019-09-10 07:45:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73968 states. [2019-09-10 07:45:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73968 states to 73968 states and 91635 transitions. [2019-09-10 07:45:41,547 INFO L78 Accepts]: Start accepts. Automaton has 73968 states and 91635 transitions. Word has length 107 [2019-09-10 07:45:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:41,547 INFO L475 AbstractCegarLoop]: Abstraction has 73968 states and 91635 transitions. [2019-09-10 07:45:41,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 07:45:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 73968 states and 91635 transitions. [2019-09-10 07:45:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:45:41,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:41,552 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] [2019-09-10 07:45:41,552 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -35124553, now seen corresponding path program 1 times [2019-09-10 07:45:41,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:41,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:41,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:41,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:41,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:41,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:41,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:41,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:45:41,728 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [848], [850], [852], [874], [877], [880], [883], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:45:41,729 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:41,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:41,906 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:42,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:42,063 INFO L272 AbstractInterpreter]: Visited 97 different actions 384 times. Merged at 36 different actions 253 times. Widened at 13 different actions 31 times. Performed 1298 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 12 different actions. Largest state had 134 variables. [2019-09-10 07:45:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:42,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:42,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:42,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:42,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:42,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:42,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:45:42,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:42,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:42,306 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:45:42,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [10] total 13 [2019-09-10 07:45:42,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:42,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:45:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:45:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:45:42,308 INFO L87 Difference]: Start difference. First operand 73968 states and 91635 transitions. Second operand 4 states. [2019-09-10 07:45:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:42,467 INFO L93 Difference]: Finished difference Result 43245 states and 52751 transitions. [2019-09-10 07:45:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:45:42,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 07:45:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:42,555 INFO L225 Difference]: With dead ends: 43245 [2019-09-10 07:45:42,555 INFO L226 Difference]: Without dead ends: 42309 [2019-09-10 07:45:42,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:45:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42309 states. [2019-09-10 07:45:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42309 to 41478. [2019-09-10 07:45:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41478 states. [2019-09-10 07:45:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41478 states to 41478 states and 50679 transitions. [2019-09-10 07:45:43,062 INFO L78 Accepts]: Start accepts. Automaton has 41478 states and 50679 transitions. Word has length 108 [2019-09-10 07:45:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:43,062 INFO L475 AbstractCegarLoop]: Abstraction has 41478 states and 50679 transitions. [2019-09-10 07:45:43,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:45:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 41478 states and 50679 transitions. [2019-09-10 07:45:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:45:43,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:43,066 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] [2019-09-10 07:45:43,067 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash 11955002, now seen corresponding path program 1 times [2019-09-10 07:45:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:43,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:43,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:43,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:43,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:45:43,390 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [848], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:45:43,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:43,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:43,405 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:43,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:43,521 INFO L272 AbstractInterpreter]: Visited 101 different actions 317 times. Merged at 40 different actions 183 times. Never widened. Performed 1152 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:45:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:43,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:43,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:43,521 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:43,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:43,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:43,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:45:43,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:43,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:44,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:44,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2019-09-10 07:45:44,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:44,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:45:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:45:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:45:44,401 INFO L87 Difference]: Start difference. First operand 41478 states and 50679 transitions. Second operand 17 states. [2019-09-10 07:45:45,007 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:45:46,365 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-09-10 07:45:46,697 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 07:45:46,889 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 07:45:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:48,765 INFO L93 Difference]: Finished difference Result 70256 states and 85450 transitions. [2019-09-10 07:45:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:45:48,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2019-09-10 07:45:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:48,840 INFO L225 Difference]: With dead ends: 70256 [2019-09-10 07:45:48,841 INFO L226 Difference]: Without dead ends: 70256 [2019-09-10 07:45:48,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:45:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70256 states. [2019-09-10 07:45:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70256 to 37706. [2019-09-10 07:45:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37706 states. [2019-09-10 07:45:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37706 states to 37706 states and 45926 transitions. [2019-09-10 07:45:49,314 INFO L78 Accepts]: Start accepts. Automaton has 37706 states and 45926 transitions. Word has length 108 [2019-09-10 07:45:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:49,314 INFO L475 AbstractCegarLoop]: Abstraction has 37706 states and 45926 transitions. [2019-09-10 07:45:49,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:45:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37706 states and 45926 transitions. [2019-09-10 07:45:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:45:49,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:49,318 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:49,318 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 661499947, now seen corresponding path program 1 times [2019-09-10 07:45:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:49,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:49,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:49,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:49,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:49,750 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:45:49,751 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [861], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:45:49,753 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:49,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:49,767 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:49,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:49,960 INFO L272 AbstractInterpreter]: Visited 102 different actions 454 times. Merged at 42 different actions 312 times. Widened at 11 different actions 43 times. Performed 1487 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 134 variables. [2019-09-10 07:45:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:49,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:49,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:49,961 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:49,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:49,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:50,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:45:50,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,909 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 07:45:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:50,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:51,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:51,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2019-09-10 07:45:51,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:51,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:45:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:45:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:45:51,116 INFO L87 Difference]: Start difference. First operand 37706 states and 45926 transitions. Second operand 19 states. [2019-09-10 07:45:51,753 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:45:52,384 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:52,649 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:45:52,905 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:45:53,351 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:45:53,762 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:45:54,059 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 07:45:54,427 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:45:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:54,628 INFO L93 Difference]: Finished difference Result 53804 states and 64981 transitions. [2019-09-10 07:45:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:45:54,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 108 [2019-09-10 07:45:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:54,679 INFO L225 Difference]: With dead ends: 53804 [2019-09-10 07:45:54,679 INFO L226 Difference]: Without dead ends: 53804 [2019-09-10 07:45:54,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:45:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53804 states. [2019-09-10 07:45:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53804 to 39789. [2019-09-10 07:45:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39789 states. [2019-09-10 07:45:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39789 states to 39789 states and 48556 transitions. [2019-09-10 07:45:55,069 INFO L78 Accepts]: Start accepts. Automaton has 39789 states and 48556 transitions. Word has length 108 [2019-09-10 07:45:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:55,069 INFO L475 AbstractCegarLoop]: Abstraction has 39789 states and 48556 transitions. [2019-09-10 07:45:55,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:45:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39789 states and 48556 transitions. [2019-09-10 07:45:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:45:55,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:55,074 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] [2019-09-10 07:45:55,074 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1540092349, now seen corresponding path program 1 times [2019-09-10 07:45:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:55,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:55,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:55,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:55,483 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:45:55,484 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:45:55,485 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:55,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:55,497 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:55,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:55,703 INFO L272 AbstractInterpreter]: Visited 101 different actions 565 times. Merged at 41 different actions 403 times. Widened at 14 different actions 72 times. Performed 1816 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1816 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 63 fixpoints after 14 different actions. Largest state had 134 variables. [2019-09-10 07:45:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:55,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:55,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:55,703 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:55,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:55,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:55,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 07:45:55,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:45:56,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:45:56,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 28 [2019-09-10 07:45:56,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:56,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:45:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:45:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:45:56,258 INFO L87 Difference]: Start difference. First operand 39789 states and 48556 transitions. Second operand 23 states. [2019-09-10 07:46:03,519 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:46:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:05,453 INFO L93 Difference]: Finished difference Result 54699 states and 65947 transitions. [2019-09-10 07:46:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 07:46:05,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 108 [2019-09-10 07:46:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:05,499 INFO L225 Difference]: With dead ends: 54699 [2019-09-10 07:46:05,499 INFO L226 Difference]: Without dead ends: 54699 [2019-09-10 07:46:05,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1121, Invalid=8191, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 07:46:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54699 states. [2019-09-10 07:46:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54699 to 41729. [2019-09-10 07:46:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41729 states. [2019-09-10 07:46:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41729 states to 41729 states and 50782 transitions. [2019-09-10 07:46:06,032 INFO L78 Accepts]: Start accepts. Automaton has 41729 states and 50782 transitions. Word has length 108 [2019-09-10 07:46:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:06,032 INFO L475 AbstractCegarLoop]: Abstraction has 41729 states and 50782 transitions. [2019-09-10 07:46:06,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:46:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41729 states and 50782 transitions. [2019-09-10 07:46:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:46:06,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:06,036 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:06,036 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1446838403, now seen corresponding path program 1 times [2019-09-10 07:46:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:06,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:06,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:06,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:06,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:46:06,239 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [861], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:46:06,240 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:06,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:06,250 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:06,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:06,446 INFO L272 AbstractInterpreter]: Visited 101 different actions 499 times. Merged at 41 different actions 354 times. Widened at 12 different actions 57 times. Performed 1617 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1617 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 17 different actions. Largest state had 134 variables. [2019-09-10 07:46:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:06,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:06,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:06,447 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:06,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:06,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 07:46:06,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:06,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:06,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:07,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:07,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2019-09-10 07:46:07,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:07,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:46:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:46:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:46:07,114 INFO L87 Difference]: Start difference. First operand 41729 states and 50782 transitions. Second operand 15 states. [2019-09-10 07:46:09,494 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-10 07:46:09,800 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-10 07:46:11,945 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:46:16,331 WARN L188 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:46:20,614 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-10 07:46:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:20,846 INFO L93 Difference]: Finished difference Result 60849 states and 74094 transitions. [2019-09-10 07:46:20,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:46:20,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-10 07:46:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:20,898 INFO L225 Difference]: With dead ends: 60849 [2019-09-10 07:46:20,898 INFO L226 Difference]: Without dead ends: 60849 [2019-09-10 07:46:20,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 205 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:46:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60849 states. [2019-09-10 07:46:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60849 to 39947. [2019-09-10 07:46:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39947 states. [2019-09-10 07:46:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39947 states to 39947 states and 48534 transitions. [2019-09-10 07:46:21,284 INFO L78 Accepts]: Start accepts. Automaton has 39947 states and 48534 transitions. Word has length 109 [2019-09-10 07:46:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:21,285 INFO L475 AbstractCegarLoop]: Abstraction has 39947 states and 48534 transitions. [2019-09-10 07:46:21,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:46:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 39947 states and 48534 transitions. [2019-09-10 07:46:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:46:21,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:21,289 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:21,289 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1845411944, now seen corresponding path program 1 times [2019-09-10 07:46:21,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:21,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:46:21,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:21,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:21,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:21,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:21,333 INFO L87 Difference]: Start difference. First operand 39947 states and 48534 transitions. Second operand 3 states. [2019-09-10 07:46:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:21,416 INFO L93 Difference]: Finished difference Result 25488 states and 30178 transitions. [2019-09-10 07:46:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:21,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:46:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:21,436 INFO L225 Difference]: With dead ends: 25488 [2019-09-10 07:46:21,437 INFO L226 Difference]: Without dead ends: 25488 [2019-09-10 07:46:21,437 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:46:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25488 states. [2019-09-10 07:46:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25488 to 25488. [2019-09-10 07:46:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25488 states. [2019-09-10 07:46:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25488 states to 25488 states and 30178 transitions. [2019-09-10 07:46:21,629 INFO L78 Accepts]: Start accepts. Automaton has 25488 states and 30178 transitions. Word has length 109 [2019-09-10 07:46:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:21,629 INFO L475 AbstractCegarLoop]: Abstraction has 25488 states and 30178 transitions. [2019-09-10 07:46:21,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25488 states and 30178 transitions. [2019-09-10 07:46:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:46:21,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:21,631 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:21,631 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1623937426, now seen corresponding path program 1 times [2019-09-10 07:46:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:22,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:22,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:22,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:46:22,002 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:46:22,003 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:22,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:22,015 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:22,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:22,145 INFO L272 AbstractInterpreter]: Visited 101 different actions 341 times. Merged at 41 different actions 211 times. Widened at 11 different actions 18 times. Performed 1189 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 10 different actions. Largest state had 134 variables. [2019-09-10 07:46:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:22,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:22,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:22,145 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:22,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:22,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:46:22,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:22,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:22,696 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:22,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:46:22,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 32 [2019-09-10 07:46:22,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:22,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:46:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:46:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:46:22,989 INFO L87 Difference]: Start difference. First operand 25488 states and 30178 transitions. Second operand 26 states. [2019-09-10 07:46:26,201 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 07:46:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:27,164 INFO L93 Difference]: Finished difference Result 37817 states and 44883 transitions. [2019-09-10 07:46:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 07:46:27,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2019-09-10 07:46:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:27,200 INFO L225 Difference]: With dead ends: 37817 [2019-09-10 07:46:27,200 INFO L226 Difference]: Without dead ends: 37817 [2019-09-10 07:46:27,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=893, Invalid=3937, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 07:46:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37817 states. [2019-09-10 07:46:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37817 to 23158. [2019-09-10 07:46:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23158 states. [2019-09-10 07:46:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23158 states to 23158 states and 27351 transitions. [2019-09-10 07:46:27,465 INFO L78 Accepts]: Start accepts. Automaton has 23158 states and 27351 transitions. Word has length 109 [2019-09-10 07:46:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:27,466 INFO L475 AbstractCegarLoop]: Abstraction has 23158 states and 27351 transitions. [2019-09-10 07:46:27,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:46:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23158 states and 27351 transitions. [2019-09-10 07:46:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:46:27,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:27,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:27,469 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -434603749, now seen corresponding path program 1 times [2019-09-10 07:46:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:46:27,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:27,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:46:27,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:27,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:46:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:46:27,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:46:27,530 INFO L87 Difference]: Start difference. First operand 23158 states and 27351 transitions. Second operand 3 states. [2019-09-10 07:46:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:27,581 INFO L93 Difference]: Finished difference Result 7515 states and 8802 transitions. [2019-09-10 07:46:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:46:27,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:46:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:27,587 INFO L225 Difference]: With dead ends: 7515 [2019-09-10 07:46:27,587 INFO L226 Difference]: Without dead ends: 7504 [2019-09-10 07:46:27,588 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:46:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2019-09-10 07:46:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 7504. [2019-09-10 07:46:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7504 states. [2019-09-10 07:46:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7504 states to 7504 states and 8791 transitions. [2019-09-10 07:46:27,645 INFO L78 Accepts]: Start accepts. Automaton has 7504 states and 8791 transitions. Word has length 109 [2019-09-10 07:46:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:27,646 INFO L475 AbstractCegarLoop]: Abstraction has 7504 states and 8791 transitions. [2019-09-10 07:46:27,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:46:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states and 8791 transitions. [2019-09-10 07:46:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:46:27,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:27,647 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:27,647 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:27,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1895159996, now seen corresponding path program 1 times [2019-09-10 07:46:27,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:27,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:28,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:28,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:28,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:46:28,280 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [863], [866], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:46:28,281 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:28,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:28,291 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:28,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:28,586 INFO L272 AbstractInterpreter]: Visited 101 different actions 587 times. Merged at 41 different actions 434 times. Widened at 14 different actions 79 times. Performed 1962 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1962 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:46:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:28,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:28,587 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:28,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:28,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:28,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:46:28,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:28,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:29,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:29,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:29,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:29,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2019-09-10 07:46:29,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:29,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:46:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:46:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:46:29,476 INFO L87 Difference]: Start difference. First operand 7504 states and 8791 transitions. Second operand 28 states. [2019-09-10 07:46:29,650 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:46:32,683 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 07:46:32,991 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:46:33,320 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:46:33,851 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:46:34,365 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:46:34,859 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:46:35,129 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:46:35,502 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:46:36,002 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:46:36,731 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:46:37,380 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:46:38,642 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:46:39,805 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:46:40,132 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:46:40,363 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:46:40,829 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 07:46:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:42,422 INFO L93 Difference]: Finished difference Result 10080 states and 11700 transitions. [2019-09-10 07:46:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 07:46:42,423 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2019-09-10 07:46:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:42,432 INFO L225 Difference]: With dead ends: 10080 [2019-09-10 07:46:42,432 INFO L226 Difference]: Without dead ends: 10080 [2019-09-10 07:46:42,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3439 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2425, Invalid=12581, Unknown=0, NotChecked=0, Total=15006 [2019-09-10 07:46:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10080 states. [2019-09-10 07:46:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10080 to 5192. [2019-09-10 07:46:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-09-10 07:46:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 6048 transitions. [2019-09-10 07:46:42,487 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 6048 transitions. Word has length 109 [2019-09-10 07:46:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:42,487 INFO L475 AbstractCegarLoop]: Abstraction has 5192 states and 6048 transitions. [2019-09-10 07:46:42,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:46:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 6048 transitions. [2019-09-10 07:46:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:46:42,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:42,488 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:42,488 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash -138541595, now seen corresponding path program 1 times [2019-09-10 07:46:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:42,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:43,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:43,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:43,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:46:43,715 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [846], [850], [852], [855], [858], [861], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:46:43,717 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:43,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:43,738 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:44,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:44,095 INFO L272 AbstractInterpreter]: Visited 102 different actions 501 times. Merged at 42 different actions 357 times. Widened at 13 different actions 57 times. Performed 1649 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1649 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 13 different actions. Largest state had 134 variables. [2019-09-10 07:46:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:44,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:44,096 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:44,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:44,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 07:46:44,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:44,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:45,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:45,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:46,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:47,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:47,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 61 [2019-09-10 07:46:47,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:47,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 07:46:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 07:46:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3369, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 07:46:47,513 INFO L87 Difference]: Start difference. First operand 5192 states and 6048 transitions. Second operand 41 states. [2019-09-10 07:46:47,756 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 07:46:51,378 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-09-10 07:46:51,595 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-09-10 07:46:51,828 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 07:46:52,081 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2019-09-10 07:46:52,349 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 07:46:52,579 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 07:46:53,085 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 07:46:53,658 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 07:46:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:57,998 INFO L93 Difference]: Finished difference Result 8783 states and 10222 transitions. [2019-09-10 07:46:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 07:46:57,998 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 110 [2019-09-10 07:46:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:58,005 INFO L225 Difference]: With dead ends: 8783 [2019-09-10 07:46:58,006 INFO L226 Difference]: Without dead ends: 8772 [2019-09-10 07:46:58,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2476 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1545, Invalid=10011, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 07:46:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8772 states. [2019-09-10 07:46:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8772 to 4907. [2019-09-10 07:46:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4907 states. [2019-09-10 07:46:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 5721 transitions. [2019-09-10 07:46:58,055 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 5721 transitions. Word has length 110 [2019-09-10 07:46:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:58,055 INFO L475 AbstractCegarLoop]: Abstraction has 4907 states and 5721 transitions. [2019-09-10 07:46:58,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 07:46:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 5721 transitions. [2019-09-10 07:46:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:46:58,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:58,056 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:58,057 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1416513494, now seen corresponding path program 1 times [2019-09-10 07:46:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:58,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:58,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:58,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:58,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:58,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:46:58,668 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [858], [863], [868], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:46:58,673 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:58,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:58,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:58,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:58,861 INFO L272 AbstractInterpreter]: Visited 102 different actions 381 times. Merged at 42 different actions 246 times. Widened at 13 different actions 34 times. Performed 1292 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1292 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 12 different actions. Largest state had 134 variables. [2019-09-10 07:46:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:58,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:58,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:58,861 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:46:58,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:58,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:59,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 07:46:59,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:59,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:59,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:00,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 45 [2019-09-10 07:47:00,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:00,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:47:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:47:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:47:00,793 INFO L87 Difference]: Start difference. First operand 4907 states and 5721 transitions. Second operand 35 states. [2019-09-10 07:47:02,353 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:47:04,764 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:05,099 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:47:05,286 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:05,495 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:47:05,813 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:06,046 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:47:06,580 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:47:06,850 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:47:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:09,195 INFO L93 Difference]: Finished difference Result 6427 states and 7553 transitions. [2019-09-10 07:47:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 07:47:09,196 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 110 [2019-09-10 07:47:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:09,200 INFO L225 Difference]: With dead ends: 6427 [2019-09-10 07:47:09,200 INFO L226 Difference]: Without dead ends: 6427 [2019-09-10 07:47:09,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1487, Invalid=7069, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 07:47:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2019-09-10 07:47:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 4870. [2019-09-10 07:47:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2019-09-10 07:47:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 5682 transitions. [2019-09-10 07:47:09,232 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 5682 transitions. Word has length 110 [2019-09-10 07:47:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:09,233 INFO L475 AbstractCegarLoop]: Abstraction has 4870 states and 5682 transitions. [2019-09-10 07:47:09,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:47:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 5682 transitions. [2019-09-10 07:47:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 07:47:09,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:09,234 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:09,234 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1043571879, now seen corresponding path program 1 times [2019-09-10 07:47:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 39 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:09,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:09,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:09,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 07:47:09,532 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [846], [848], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [892], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:47:09,534 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:09,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:09,545 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:09,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:09,780 INFO L272 AbstractInterpreter]: Visited 104 different actions 585 times. Merged at 44 different actions 402 times. Widened at 15 different actions 69 times. Performed 1839 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1839 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 79 fixpoints after 16 different actions. Largest state had 134 variables. [2019-09-10 07:47:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:09,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:09,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:09,781 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:47:09,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:09,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:09,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:47:09,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:10,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:10,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:11,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:11,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:11,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:12,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 42 [2019-09-10 07:47:12,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:12,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:47:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:47:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:47:12,045 INFO L87 Difference]: Start difference. First operand 4870 states and 5682 transitions. Second operand 27 states. [2019-09-10 07:47:14,407 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:47:14,599 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:47:14,793 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:47:15,314 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:47:15,599 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:47:16,224 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:47:16,501 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:47:16,813 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:47:17,096 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:47:17,716 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 07:47:18,025 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 07:47:18,203 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:47:18,398 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:47:18,819 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:47:19,068 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:47:19,258 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:47:19,470 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:47:19,648 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:47:19,841 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:47:20,124 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 07:47:20,351 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:47:20,527 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:47:20,849 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:47:21,270 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 07:47:21,662 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-09-10 07:47:22,064 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-09-10 07:47:22,245 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:47:22,597 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 07:47:22,771 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:47:22,960 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:47:23,269 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-09-10 07:47:23,638 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 07:47:23,834 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:47:24,025 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:47:24,788 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-09-10 07:47:25,719 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-09-10 07:47:26,398 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:47:26,600 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:47:27,028 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-09-10 07:47:27,263 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-09-10 07:47:27,648 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:47:27,843 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 07:47:28,155 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 07:47:28,395 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-09-10 07:47:28,759 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-09-10 07:47:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:28,920 INFO L93 Difference]: Finished difference Result 6604 states and 7558 transitions. [2019-09-10 07:47:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 07:47:28,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 155 [2019-09-10 07:47:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:28,926 INFO L225 Difference]: With dead ends: 6604 [2019-09-10 07:47:28,926 INFO L226 Difference]: Without dead ends: 6604 [2019-09-10 07:47:28,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 267 SyntacticMatches, 14 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3209 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=2626, Invalid=10946, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 07:47:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2019-09-10 07:47:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 4898. [2019-09-10 07:47:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4898 states. [2019-09-10 07:47:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 5667 transitions. [2019-09-10 07:47:28,964 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 5667 transitions. Word has length 155 [2019-09-10 07:47:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:28,964 INFO L475 AbstractCegarLoop]: Abstraction has 4898 states and 5667 transitions. [2019-09-10 07:47:28,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 07:47:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 5667 transitions. [2019-09-10 07:47:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 07:47:28,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:28,966 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:28,966 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash -548423233, now seen corresponding path program 1 times [2019-09-10 07:47:28,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:28,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:28,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:29,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:29,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:29,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 07:47:29,452 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [861], [870], [872], [874], [877], [880], [885], [890], [892], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:47:29,455 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:29,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:29,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:29,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:29,761 INFO L272 AbstractInterpreter]: Visited 104 different actions 712 times. Merged at 44 different actions 504 times. Widened at 17 different actions 98 times. Performed 2177 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 102 fixpoints after 19 different actions. Largest state had 134 variables. [2019-09-10 07:47:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:29,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:29,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:29,762 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:29,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:29,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:47:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:29,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:47:29,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:30,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:31,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:33,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:33,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 21] total 53 [2019-09-10 07:47:33,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:33,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 07:47:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 07:47:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2446, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:47:33,585 INFO L87 Difference]: Start difference. First operand 4898 states and 5667 transitions. Second operand 34 states. [2019-09-10 07:47:37,512 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:47:37,819 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 07:47:38,400 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:47:39,251 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:47:39,758 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 07:47:40,256 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 07:47:40,877 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:41,446 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:47:41,894 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:47:42,234 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:47:42,426 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:47:42,742 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:47:43,069 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:43,341 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:47:43,720 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:47:44,346 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:47:44,678 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:47:45,022 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:47:45,281 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:47:45,512 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:47:46,068 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 07:47:46,320 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-10 07:47:46,478 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:47:46,754 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:47:48,412 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:47:48,992 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 07:47:51,412 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:47:51,816 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:47:52,072 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:47:52,382 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:47:52,574 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:47:52,813 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:47:53,267 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:47:53,496 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:47:53,729 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:47:54,138 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 07:47:54,362 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:47:54,612 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:47:54,858 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:47:55,075 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:47:55,358 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:47:55,614 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:47:55,993 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:47:56,475 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:47:56,700 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:47:58,348 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 07:47:59,327 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:48:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:00,146 INFO L93 Difference]: Finished difference Result 9005 states and 10428 transitions. [2019-09-10 07:48:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-10 07:48:00,146 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 155 [2019-09-10 07:48:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:00,154 INFO L225 Difference]: With dead ends: 9005 [2019-09-10 07:48:00,154 INFO L226 Difference]: Without dead ends: 9005 [2019-09-10 07:48:00,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 254 SyntacticMatches, 21 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9673 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=5160, Invalid=27060, Unknown=0, NotChecked=0, Total=32220 [2019-09-10 07:48:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9005 states. [2019-09-10 07:48:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9005 to 6433. [2019-09-10 07:48:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6433 states. [2019-09-10 07:48:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6433 states to 6433 states and 7469 transitions. [2019-09-10 07:48:00,213 INFO L78 Accepts]: Start accepts. Automaton has 6433 states and 7469 transitions. Word has length 155 [2019-09-10 07:48:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:00,213 INFO L475 AbstractCegarLoop]: Abstraction has 6433 states and 7469 transitions. [2019-09-10 07:48:00,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 07:48:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6433 states and 7469 transitions. [2019-09-10 07:48:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 07:48:00,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:00,214 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:00,215 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1311874467, now seen corresponding path program 1 times [2019-09-10 07:48:00,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:01,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:01,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:01,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 07:48:01,043 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [846], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:48:01,045 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:01,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:01,054 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:01,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:01,289 INFO L272 AbstractInterpreter]: Visited 103 different actions 604 times. Merged at 44 different actions 430 times. Widened at 15 different actions 74 times. Performed 1917 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1917 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 65 fixpoints after 15 different actions. Largest state had 134 variables. [2019-09-10 07:48:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:01,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:01,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:01,290 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:01,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:01,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:01,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 07:48:01,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:01,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:02,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:02,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:04,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:04,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 20] total 61 [2019-09-10 07:48:04,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:04,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 07:48:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 07:48:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3496, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 07:48:04,730 INFO L87 Difference]: Start difference. First operand 6433 states and 7469 transitions. Second operand 46 states. [2019-09-10 07:48:09,374 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-09-10 07:48:09,655 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-09-10 07:48:09,921 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-09-10 07:48:10,219 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-09-10 07:48:10,986 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 07:48:11,266 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-09-10 07:48:12,070 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 07:48:12,491 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-09-10 07:48:12,879 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:48:13,174 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:48:13,598 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:48:14,245 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 07:48:14,835 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 07:48:17,769 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:48:18,669 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 07:48:19,506 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 07:48:19,840 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-10 07:48:20,062 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:48:21,667 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-09-10 07:48:22,259 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 07:48:22,524 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 07:48:22,945 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 07:48:23,354 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 07:48:24,023 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 07:48:24,428 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:48:25,637 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 07:48:27,843 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:48:29,301 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 07:48:29,741 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 07:48:29,964 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:48:30,186 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:48:30,468 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:48:30,705 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:48:31,070 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:48:31,456 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:48:31,735 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:48:32,393 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:48:32,647 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 07:48:32,883 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:48:33,171 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 07:48:33,396 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 07:48:33,812 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:48:34,431 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:48:34,673 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 07:48:35,074 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:48:35,485 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 07:48:35,902 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 07:48:36,180 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:48:36,415 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:48:37,572 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:48:37,801 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:48:38,036 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 07:48:38,261 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 07:48:39,288 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:48:39,504 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:48:47,580 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:48:49,134 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:48:50,757 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:48:51,281 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:48:52,675 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:48:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:55,459 INFO L93 Difference]: Finished difference Result 17207 states and 19883 transitions. [2019-09-10 07:48:55,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-09-10 07:48:55,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 156 [2019-09-10 07:48:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:55,475 INFO L225 Difference]: With dead ends: 17207 [2019-09-10 07:48:55,476 INFO L226 Difference]: Without dead ends: 17207 [2019-09-10 07:48:55,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 273 SyntacticMatches, 4 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30035 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=7628, Invalid=80878, Unknown=0, NotChecked=0, Total=88506 [2019-09-10 07:48:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17207 states. [2019-09-10 07:48:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17207 to 7815. [2019-09-10 07:48:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7815 states. [2019-09-10 07:48:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7815 states to 7815 states and 9112 transitions. [2019-09-10 07:48:55,565 INFO L78 Accepts]: Start accepts. Automaton has 7815 states and 9112 transitions. Word has length 156 [2019-09-10 07:48:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:55,566 INFO L475 AbstractCegarLoop]: Abstraction has 7815 states and 9112 transitions. [2019-09-10 07:48:55,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 07:48:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7815 states and 9112 transitions. [2019-09-10 07:48:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 07:48:55,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:55,567 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:55,567 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 166549737, now seen corresponding path program 1 times [2019-09-10 07:48:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:55,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:56,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:56,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:56,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 07:48:56,109 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [624], [646], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [861], [863], [866], [872], [874], [877], [880], [885], [888], [890], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:48:56,111 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:56,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:56,120 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:56,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:56,357 INFO L272 AbstractInterpreter]: Visited 103 different actions 442 times. Merged at 44 different actions 290 times. Widened at 12 different actions 29 times. Performed 1550 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 12 different actions. Largest state had 134 variables. [2019-09-10 07:48:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:56,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:56,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:56,358 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:56,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:56,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:48:56,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:01,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:02,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:02,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:02,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 19] total 55 [2019-09-10 07:49:02,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:02,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:49:02,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:49:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2773, Unknown=2, NotChecked=0, Total=2970 [2019-09-10 07:49:02,856 INFO L87 Difference]: Start difference. First operand 7815 states and 9112 transitions. Second operand 39 states. [2019-09-10 07:49:05,811 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2019-09-10 07:49:06,325 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 07:49:09,285 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 07:49:09,817 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-10 07:49:10,338 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-09-10 07:49:11,004 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 07:49:13,103 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:49:17,629 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-09-10 07:49:20,993 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-10 07:49:24,663 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 07:49:25,970 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 33 [2019-09-10 07:49:26,224 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 35 [2019-09-10 07:49:26,609 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-10 07:49:31,195 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-10 07:49:31,998 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 41 [2019-09-10 07:49:32,814 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-09-10 07:49:35,420 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:49:37,756 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:49:39,892 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 07:49:40,432 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-09-10 07:49:43,840 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-10 07:49:44,250 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2019-09-10 07:49:45,483 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2019-09-10 07:49:46,095 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 35 [2019-09-10 07:49:51,056 WARN L188 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 108 DAG size of output: 41 [2019-09-10 07:49:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:53,602 INFO L93 Difference]: Finished difference Result 13110 states and 15196 transitions. [2019-09-10 07:49:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-10 07:49:53,603 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 156 [2019-09-10 07:49:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:53,611 INFO L225 Difference]: With dead ends: 13110 [2019-09-10 07:49:53,611 INFO L226 Difference]: Without dead ends: 13110 [2019-09-10 07:49:53,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6625 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=3131, Invalid=22627, Unknown=2, NotChecked=0, Total=25760 [2019-09-10 07:49:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13110 states. [2019-09-10 07:49:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13110 to 8944. [2019-09-10 07:49:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8944 states. [2019-09-10 07:49:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 10371 transitions. [2019-09-10 07:49:53,680 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 10371 transitions. Word has length 156 [2019-09-10 07:49:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:53,680 INFO L475 AbstractCegarLoop]: Abstraction has 8944 states and 10371 transitions. [2019-09-10 07:49:53,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:49:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 10371 transitions. [2019-09-10 07:49:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 07:49:53,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:53,681 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:53,682 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1558037977, now seen corresponding path program 1 times [2019-09-10 07:49:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:53,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:54,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:54,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:54,007 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 07:49:54,008 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [850], [852], [855], [858], [863], [868], [870], [872], [874], [877], [880], [883], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:49:54,009 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:54,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:54,027 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:54,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:54,268 INFO L272 AbstractInterpreter]: Visited 103 different actions 543 times. Merged at 43 different actions 376 times. Widened at 15 different actions 59 times. Performed 1743 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1743 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 64 fixpoints after 17 different actions. Largest state had 134 variables. [2019-09-10 07:49:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:54,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:54,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:54,268 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:54,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:54,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:54,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:49:54,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:54,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:54,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:55,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:50:01,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:01,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:50:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:50:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:50:01,555 INFO L87 Difference]: Start difference. First operand 8944 states and 10371 transitions. Second operand 20 states. [2019-09-10 07:50:01,714 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:50:02,076 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:50:02,721 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:50:03,321 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:50:03,567 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:50:03,728 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:50:04,274 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:50:04,548 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:50:04,929 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:50:05,232 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:50:05,585 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:50:06,007 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:50:06,308 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:50:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:06,348 INFO L93 Difference]: Finished difference Result 10543 states and 12190 transitions. [2019-09-10 07:50:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:50:06,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 156 [2019-09-10 07:50:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:06,357 INFO L225 Difference]: With dead ends: 10543 [2019-09-10 07:50:06,357 INFO L226 Difference]: Without dead ends: 10543 [2019-09-10 07:50:06,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 232 SyntacticMatches, 67 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=412, Invalid=1228, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:50:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10543 states. [2019-09-10 07:50:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10543 to 8944. [2019-09-10 07:50:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8944 states. [2019-09-10 07:50:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 10335 transitions. [2019-09-10 07:50:06,434 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 10335 transitions. Word has length 156 [2019-09-10 07:50:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:06,434 INFO L475 AbstractCegarLoop]: Abstraction has 8944 states and 10335 transitions. [2019-09-10 07:50:06,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:50:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 10335 transitions. [2019-09-10 07:50:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 07:50:06,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:06,435 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:06,436 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1868848016, now seen corresponding path program 1 times [2019-09-10 07:50:06,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:06,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:06,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:06,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:06,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:06,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:06,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:06,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 07:50:06,828 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [841], [844], [850], [852], [855], [858], [863], [866], [868], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:50:06,830 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:06,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:06,840 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:06,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:06,977 INFO L272 AbstractInterpreter]: Visited 103 different actions 450 times. Merged at 44 different actions 297 times. Widened at 13 different actions 36 times. Performed 1556 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 12 different actions. Largest state had 134 variables. [2019-09-10 07:50:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:06,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:06,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:06,977 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:06,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:06,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:07,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 07:50:07,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:07,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:07,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:08,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:08,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:08,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:09,399 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:10,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:10,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:10,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:10,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:10,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:10,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:11,251 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:50:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:50:11,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:11,810 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:50:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:50:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 25] total 63 [2019-09-10 07:50:12,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:12,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 07:50:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 07:50:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3555, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 07:50:12,222 INFO L87 Difference]: Start difference. First operand 8944 states and 10335 transitions. Second operand 41 states. [2019-09-10 07:50:12,618 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:50:13,783 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:50:14,495 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:50:15,110 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:50:15,778 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 07:50:16,642 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 07:50:17,345 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:50:17,752 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:50:18,302 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:50:18,779 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 07:50:18,986 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:50:22,852 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 07:50:23,468 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-10 07:50:26,249 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2019-09-10 07:50:26,502 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:50:27,294 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 07:50:29,192 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 07:50:30,002 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-10 07:50:31,179 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:50:32,172 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:50:32,682 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 07:50:33,415 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:33,673 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-09-10 07:50:34,224 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:34,881 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-10 07:50:35,404 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-10 07:50:36,164 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 07:50:36,580 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:50:36,861 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:50:37,518 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-10 07:50:38,031 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-09-10 07:50:38,584 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-09-10 07:50:39,308 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2019-09-10 07:50:40,233 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:50:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:43,074 INFO L93 Difference]: Finished difference Result 10440 states and 12041 transitions. [2019-09-10 07:50:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 07:50:43,074 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-09-10 07:50:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:43,081 INFO L225 Difference]: With dead ends: 10440 [2019-09-10 07:50:43,081 INFO L226 Difference]: Without dead ends: 10440 [2019-09-10 07:50:43,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 256 SyntacticMatches, 11 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4011 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=2245, Invalid=14267, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 07:50:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-09-10 07:50:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 9381. [2019-09-10 07:50:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9381 states. [2019-09-10 07:50:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 10805 transitions. [2019-09-10 07:50:43,148 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 10805 transitions. Word has length 156 [2019-09-10 07:50:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:43,148 INFO L475 AbstractCegarLoop]: Abstraction has 9381 states and 10805 transitions. [2019-09-10 07:50:43,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 07:50:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 10805 transitions. [2019-09-10 07:50:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:50:43,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:43,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:43,150 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash 158876217, now seen corresponding path program 1 times [2019-09-10 07:50:43,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:43,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:43,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:43,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:43,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 07:50:43,541 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [841], [846], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:50:43,543 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:43,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:43,554 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:43,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:43,965 INFO L272 AbstractInterpreter]: Visited 103 different actions 766 times. Merged at 43 different actions 571 times. Widened at 16 different actions 109 times. Performed 2332 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 95 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 07:50:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:43,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:43,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:43,965 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:43,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:43,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:44,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 07:50:44,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:44,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:45,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:45,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:45,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 52 [2019-09-10 07:50:45,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:45,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 07:50:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 07:50:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2371, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:50:45,861 INFO L87 Difference]: Start difference. First operand 9381 states and 10805 transitions. Second operand 38 states. [2019-09-10 07:50:46,026 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:50:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:50,314 INFO L93 Difference]: Finished difference Result 10943 states and 12760 transitions. [2019-09-10 07:50:50,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 07:50:50,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 157 [2019-09-10 07:50:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:50,322 INFO L225 Difference]: With dead ends: 10943 [2019-09-10 07:50:50,322 INFO L226 Difference]: Without dead ends: 10943 [2019-09-10 07:50:50,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 279 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1171, Invalid=6485, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:50:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10943 states. [2019-09-10 07:50:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10943 to 9371. [2019-09-10 07:50:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9371 states. [2019-09-10 07:50:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9371 states to 9371 states and 10794 transitions. [2019-09-10 07:50:50,389 INFO L78 Accepts]: Start accepts. Automaton has 9371 states and 10794 transitions. Word has length 157 [2019-09-10 07:50:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:50,389 INFO L475 AbstractCegarLoop]: Abstraction has 9371 states and 10794 transitions. [2019-09-10 07:50:50,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 07:50:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9371 states and 10794 transitions. [2019-09-10 07:50:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:50:50,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:50,391 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:50:50,391 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1718878155, now seen corresponding path program 1 times [2019-09-10 07:50:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:50,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:50:50,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:50,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:50,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 07:50:50,538 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [846], [850], [852], [855], [858], [861], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:50:50,539 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:50,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:50,550 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:50,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:50,738 INFO L272 AbstractInterpreter]: Visited 101 different actions 614 times. Merged at 42 different actions 449 times. Widened at 13 different actions 69 times. Performed 2006 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2006 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 15 different actions. Largest state had 134 variables. [2019-09-10 07:50:50,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:50,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:50,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:50,739 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:50,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:50,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:50:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:50:51,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:50:51,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:51,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 16 [2019-09-10 07:50:51,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:51,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:50:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:50:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:50:51,316 INFO L87 Difference]: Start difference. First operand 9371 states and 10794 transitions. Second operand 10 states. [2019-09-10 07:50:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:51,604 INFO L93 Difference]: Finished difference Result 17809 states and 20229 transitions. [2019-09-10 07:50:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:50:51,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2019-09-10 07:50:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:51,619 INFO L225 Difference]: With dead ends: 17809 [2019-09-10 07:50:51,619 INFO L226 Difference]: Without dead ends: 17809 [2019-09-10 07:50:51,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:50:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17809 states. [2019-09-10 07:50:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17809 to 17640. [2019-09-10 07:50:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17640 states. [2019-09-10 07:50:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17640 states to 17640 states and 20042 transitions. [2019-09-10 07:50:51,729 INFO L78 Accepts]: Start accepts. Automaton has 17640 states and 20042 transitions. Word has length 157 [2019-09-10 07:50:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:51,729 INFO L475 AbstractCegarLoop]: Abstraction has 17640 states and 20042 transitions. [2019-09-10 07:50:51,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:50:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17640 states and 20042 transitions. [2019-09-10 07:50:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 07:50:51,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:51,730 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:51,731 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1082095768, now seen corresponding path program 1 times [2019-09-10 07:50:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:51,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:52,401 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-09-10 07:50:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:53,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:53,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:53,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 07:50:53,106 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [227], [263], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [839], [841], [844], [850], [852], [855], [858], [863], [866], [868], [872], [874], [877], [880], [883], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:50:53,107 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:53,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:53,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:53,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:53,235 INFO L272 AbstractInterpreter]: Visited 104 different actions 406 times. Merged at 44 different actions 259 times. Widened at 8 different actions 23 times. Performed 1387 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 10 different actions. Largest state had 134 variables. [2019-09-10 07:50:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:53,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:53,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:53,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:53,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:53,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 07:50:53,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:53,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:53,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:00,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:12,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 19] total 59 [2019-09-10 07:51:14,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:14,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 07:51:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 07:51:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3220, Unknown=3, NotChecked=0, Total=3422 [2019-09-10 07:51:14,329 INFO L87 Difference]: Start difference. First operand 17640 states and 20042 transitions. Second operand 42 states. [2019-09-10 07:51:14,902 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:51:17,251 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-09-10 07:51:19,632 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2019-09-10 07:51:20,320 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2019-09-10 07:51:21,777 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2019-09-10 07:51:22,914 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-09-10 07:51:25,135 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:51:26,074 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 36 [2019-09-10 07:51:27,050 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2019-09-10 07:51:28,907 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2019-09-10 07:51:29,468 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 55 [2019-09-10 07:51:30,683 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-09-10 07:51:32,037 WARN L188 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-09-10 07:51:32,576 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:51:33,980 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-09-10 07:51:36,389 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-09-10 07:51:45,698 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2019-09-10 07:51:46,991 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-09-10 07:51:49,726 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:51:55,590 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 07:51:56,982 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-09-10 07:51:57,721 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:51:58,102 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:51:58,774 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 07:52:01,685 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:52:02,125 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:52:02,666 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:52:03,054 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:52:03,350 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64