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.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:25:31,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:25:31,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:25:31,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:25:31,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:25:31,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:25:31,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:25:31,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:25:31,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:25:31,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:25:31,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:25:31,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:25:31,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:25:31,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:25:31,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:25:31,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:25:31,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:25:31,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:25:31,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:25:31,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:25:31,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:25:31,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:25:31,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:25:31,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:25:31,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:25:31,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:25:31,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:25:31,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:25:31,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:25:31,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:25:31,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:25:31,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:25:31,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:25:31,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:25:31,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:25:31,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:25:31,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:25:31,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:25:31,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:25:31,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:25:31,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:25:31,668 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:25:31,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:25:31,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:25:31,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:25:31,705 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:25:31,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:25:31,706 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:25:31,706 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:25:31,706 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:25:31,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:25:31,706 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:25:31,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:25:31,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:25:31,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:25:31,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:25:31,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:25:31,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:25:31,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:25:31,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:25:31,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:25:31,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:25:31,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:25:31,709 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:25:31,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:25:31,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:31,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:25:31,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:25:31,711 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:25:31,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:25:31,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:25:31,711 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:25:31,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:25:31,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:25:31,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:25:31,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:25:31,765 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:25:31,766 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.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 07:25:31,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56b06616/e512a5c274ee4e609eb60eff5b215ebb/FLAG755189db1 [2019-09-10 07:25:32,332 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:25:32,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 07:25:32,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56b06616/e512a5c274ee4e609eb60eff5b215ebb/FLAG755189db1 [2019-09-10 07:25:32,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56b06616/e512a5c274ee4e609eb60eff5b215ebb [2019-09-10 07:25:32,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:25:32,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:25:32,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:32,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:25:32,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:25:32,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:32" (1/1) ... [2019-09-10 07:25:32,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d99d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:32, skipping insertion in model container [2019-09-10 07:25:32,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:32" (1/1) ... [2019-09-10 07:25:32,739 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:25:32,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:25:33,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:33,214 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:25:33,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:33,306 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:25:33,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33 WrapperNode [2019-09-10 07:25:33,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:33,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:25:33,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:25:33,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:25:33,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (1/1) ... [2019-09-10 07:25:33,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:25:33,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:25:33,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:25:33,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:25:33,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (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:25:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:25:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:25:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:25:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:25:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:25:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:25:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:25:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:25:34,187 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:25:34,187 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:25:34,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:34 BoogieIcfgContainer [2019-09-10 07:25:34,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:25:34,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:25:34,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:25:34,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:25:34,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:25:32" (1/3) ... [2019-09-10 07:25:34,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa48e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:34, skipping insertion in model container [2019-09-10 07:25:34,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:33" (2/3) ... [2019-09-10 07:25:34,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa48e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:34, skipping insertion in model container [2019-09-10 07:25:34,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:34" (3/3) ... [2019-09-10 07:25:34,198 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 07:25:34,209 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:25:34,218 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 07:25:34,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 07:25:34,261 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:25:34,262 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:25:34,262 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:25:34,262 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:25:34,262 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:25:34,262 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:25:34,263 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:25:34,263 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:25:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-10 07:25:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:25:34,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:34,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:34,296 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash -304932933, now seen corresponding path program 1 times [2019-09-10 07:25:34,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:34,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:34,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:34,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:34,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:34,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:34,731 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-10 07:25:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:34,889 INFO L93 Difference]: Finished difference Result 165 states and 264 transitions. [2019-09-10 07:25:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:34,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 07:25:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:34,909 INFO L225 Difference]: With dead ends: 165 [2019-09-10 07:25:34,909 INFO L226 Difference]: Without dead ends: 157 [2019-09-10 07:25:34,913 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:25:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-10 07:25:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2019-09-10 07:25:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-10 07:25:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 216 transitions. [2019-09-10 07:25:34,968 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 216 transitions. Word has length 52 [2019-09-10 07:25:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:34,969 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 216 transitions. [2019-09-10 07:25:34,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 216 transitions. [2019-09-10 07:25:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:25:34,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:34,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:34,973 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1031148298, now seen corresponding path program 1 times [2019-09-10 07:25:34,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:35,116 INFO L134 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:25:35,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:35,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:35,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:35,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:35,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:35,119 INFO L87 Difference]: Start difference. First operand 155 states and 216 transitions. Second operand 3 states. [2019-09-10 07:25:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:35,185 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2019-09-10 07:25:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:35,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 07:25:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:35,190 INFO L225 Difference]: With dead ends: 199 [2019-09-10 07:25:35,190 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 07:25:35,193 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:25:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 07:25:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-09-10 07:25:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-10 07:25:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2019-09-10 07:25:35,223 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 53 [2019-09-10 07:25:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:35,224 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2019-09-10 07:25:35,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2019-09-10 07:25:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:25:35,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:35,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:35,227 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash 337411901, now seen corresponding path program 1 times [2019-09-10 07:25:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:35,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:35,402 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand 5 states. [2019-09-10 07:25:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:35,620 INFO L93 Difference]: Finished difference Result 343 states and 494 transitions. [2019-09-10 07:25:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:35,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 07:25:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:35,624 INFO L225 Difference]: With dead ends: 343 [2019-09-10 07:25:35,624 INFO L226 Difference]: Without dead ends: 343 [2019-09-10 07:25:35,625 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:25:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-10 07:25:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 338. [2019-09-10 07:25:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-10 07:25:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 491 transitions. [2019-09-10 07:25:35,656 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 491 transitions. Word has length 54 [2019-09-10 07:25:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:35,657 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 491 transitions. [2019-09-10 07:25:35,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 491 transitions. [2019-09-10 07:25:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:25:35,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:35,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:35,660 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 357669605, now seen corresponding path program 1 times [2019-09-10 07:25:35,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:35,753 INFO L134 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:25:35,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:35,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:35,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:35,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:35,755 INFO L87 Difference]: Start difference. First operand 338 states and 491 transitions. Second operand 5 states. [2019-09-10 07:25:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:35,876 INFO L93 Difference]: Finished difference Result 338 states and 484 transitions. [2019-09-10 07:25:35,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:35,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 07:25:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:35,879 INFO L225 Difference]: With dead ends: 338 [2019-09-10 07:25:35,879 INFO L226 Difference]: Without dead ends: 338 [2019-09-10 07:25:35,879 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:25:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-10 07:25:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-09-10 07:25:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-10 07:25:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 484 transitions. [2019-09-10 07:25:35,895 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 484 transitions. Word has length 55 [2019-09-10 07:25:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:35,895 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 484 transitions. [2019-09-10 07:25:35,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 484 transitions. [2019-09-10 07:25:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:25:35,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:35,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:35,898 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1558285795, now seen corresponding path program 1 times [2019-09-10 07:25:35,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:35,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:35,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:35,996 INFO L134 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:25:35,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:35,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:35,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:35,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:35,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:35,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:35,999 INFO L87 Difference]: Start difference. First operand 338 states and 484 transitions. Second operand 5 states. [2019-09-10 07:25:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:36,149 INFO L93 Difference]: Finished difference Result 338 states and 477 transitions. [2019-09-10 07:25:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:36,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:25:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:36,155 INFO L225 Difference]: With dead ends: 338 [2019-09-10 07:25:36,156 INFO L226 Difference]: Without dead ends: 338 [2019-09-10 07:25:36,156 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:25:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-10 07:25:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-09-10 07:25:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-10 07:25:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2019-09-10 07:25:36,172 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 56 [2019-09-10 07:25:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,172 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2019-09-10 07:25:36,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2019-09-10 07:25:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:36,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:36,181 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,183 INFO L82 PathProgramCache]: Analyzing trace with hash -557631818, now seen corresponding path program 1 times [2019-09-10 07:25:36,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:36,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:36,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:36,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:36,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:36,335 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand 5 states. [2019-09-10 07:25:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:36,445 INFO L93 Difference]: Finished difference Result 855 states and 1224 transitions. [2019-09-10 07:25:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:36,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 07:25:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:36,453 INFO L225 Difference]: With dead ends: 855 [2019-09-10 07:25:36,453 INFO L226 Difference]: Without dead ends: 855 [2019-09-10 07:25:36,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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:25:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-09-10 07:25:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 510. [2019-09-10 07:25:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-10 07:25:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 729 transitions. [2019-09-10 07:25:36,477 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 729 transitions. Word has length 57 [2019-09-10 07:25:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,479 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 729 transitions. [2019-09-10 07:25:36,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2019-09-10 07:25:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:36,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,486 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1406729891, now seen corresponding path program 1 times [2019-09-10 07:25:36,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:36,603 INFO L134 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:25:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:36,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:36,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:36,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:36,605 INFO L87 Difference]: Start difference. First operand 510 states and 729 transitions. Second operand 5 states. [2019-09-10 07:25:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:36,726 INFO L93 Difference]: Finished difference Result 1047 states and 1506 transitions. [2019-09-10 07:25:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:36,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 07:25:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:36,733 INFO L225 Difference]: With dead ends: 1047 [2019-09-10 07:25:36,733 INFO L226 Difference]: Without dead ends: 1047 [2019-09-10 07:25:36,734 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:25:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-10 07:25:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 771. [2019-09-10 07:25:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-10 07:25:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1110 transitions. [2019-09-10 07:25:36,760 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1110 transitions. Word has length 57 [2019-09-10 07:25:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,761 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1110 transitions. [2019-09-10 07:25:36,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1110 transitions. [2019-09-10 07:25:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:36,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,762 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1122162400, now seen corresponding path program 1 times [2019-09-10 07:25:36,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:36,837 INFO L134 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:25:36,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:36,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:36,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:36,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:36,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:36,840 INFO L87 Difference]: Start difference. First operand 771 states and 1110 transitions. Second operand 5 states. [2019-09-10 07:25:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:36,933 INFO L93 Difference]: Finished difference Result 995 states and 1433 transitions. [2019-09-10 07:25:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:36,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 07:25:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:36,939 INFO L225 Difference]: With dead ends: 995 [2019-09-10 07:25:36,939 INFO L226 Difference]: Without dead ends: 995 [2019-09-10 07:25:36,940 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:25:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-10 07:25:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 858. [2019-09-10 07:25:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-10 07:25:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1241 transitions. [2019-09-10 07:25:36,965 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1241 transitions. Word has length 57 [2019-09-10 07:25:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,966 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1241 transitions. [2019-09-10 07:25:36,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1241 transitions. [2019-09-10 07:25:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:25:36,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,968 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash -274879141, now seen corresponding path program 1 times [2019-09-10 07:25:36,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:37,261 INFO L134 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:25:37,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:37,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:25:37,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:37,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:25:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:25:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:37,263 INFO L87 Difference]: Start difference. First operand 858 states and 1241 transitions. Second operand 9 states. [2019-09-10 07:25:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:37,771 INFO L93 Difference]: Finished difference Result 1607 states and 2338 transitions. [2019-09-10 07:25:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:25:37,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-10 07:25:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:37,780 INFO L225 Difference]: With dead ends: 1607 [2019-09-10 07:25:37,780 INFO L226 Difference]: Without dead ends: 1607 [2019-09-10 07:25:37,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:25:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-09-10 07:25:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 858. [2019-09-10 07:25:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-10 07:25:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1240 transitions. [2019-09-10 07:25:37,814 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1240 transitions. Word has length 58 [2019-09-10 07:25:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:37,815 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1240 transitions. [2019-09-10 07:25:37,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:25:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1240 transitions. [2019-09-10 07:25:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:25:37,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:37,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,816 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash -595457999, now seen corresponding path program 1 times [2019-09-10 07:25:37,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:37,995 INFO L134 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:25:37,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:37,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:37,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:37,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:37,997 INFO L87 Difference]: Start difference. First operand 858 states and 1240 transitions. Second operand 10 states. [2019-09-10 07:25:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:38,976 INFO L93 Difference]: Finished difference Result 1423 states and 2054 transitions. [2019-09-10 07:25:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:25:38,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:25:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:38,984 INFO L225 Difference]: With dead ends: 1423 [2019-09-10 07:25:38,985 INFO L226 Difference]: Without dead ends: 1423 [2019-09-10 07:25:38,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:25:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-10 07:25:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 858. [2019-09-10 07:25:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-10 07:25:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1237 transitions. [2019-09-10 07:25:39,016 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1237 transitions. Word has length 58 [2019-09-10 07:25:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:39,016 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1237 transitions. [2019-09-10 07:25:39,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1237 transitions. [2019-09-10 07:25:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:25:39,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:39,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:39,018 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1742248038, now seen corresponding path program 1 times [2019-09-10 07:25:39,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:39,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:39,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:39,193 INFO L134 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:25:39,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:39,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:39,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:39,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:39,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:39,195 INFO L87 Difference]: Start difference. First operand 858 states and 1237 transitions. Second operand 10 states. [2019-09-10 07:25:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:40,022 INFO L93 Difference]: Finished difference Result 1658 states and 2386 transitions. [2019-09-10 07:25:40,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:25:40,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-10 07:25:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:40,034 INFO L225 Difference]: With dead ends: 1658 [2019-09-10 07:25:40,034 INFO L226 Difference]: Without dead ends: 1658 [2019-09-10 07:25:40,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:25:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-09-10 07:25:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 858. [2019-09-10 07:25:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-10 07:25:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1231 transitions. [2019-09-10 07:25:40,079 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1231 transitions. Word has length 59 [2019-09-10 07:25:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:40,079 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1231 transitions. [2019-09-10 07:25:40,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1231 transitions. [2019-09-10 07:25:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:40,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:40,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:40,081 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1512000741, now seen corresponding path program 1 times [2019-09-10 07:25:40,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:40,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:25:40,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:40,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:25:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:25:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:25:40,878 INFO L87 Difference]: Start difference. First operand 858 states and 1231 transitions. Second operand 21 states. [2019-09-10 07:25:41,067 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:25:41,885 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:25:42,078 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 07:25:42,323 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:25:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:45,280 INFO L93 Difference]: Finished difference Result 4039 states and 5908 transitions. [2019-09-10 07:25:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:25:45,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-10 07:25:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:45,298 INFO L225 Difference]: With dead ends: 4039 [2019-09-10 07:25:45,299 INFO L226 Difference]: Without dead ends: 4039 [2019-09-10 07:25:45,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:25:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2019-09-10 07:25:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 863. [2019-09-10 07:25:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-10 07:25:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1236 transitions. [2019-09-10 07:25:45,351 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1236 transitions. Word has length 60 [2019-09-10 07:25:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:45,351 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1236 transitions. [2019-09-10 07:25:45,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:25:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1236 transitions. [2019-09-10 07:25:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:45,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:45,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:45,353 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 864203142, now seen corresponding path program 1 times [2019-09-10 07:25:45,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:45,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:25:45,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:45,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:25:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:25:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:25:45,909 INFO L87 Difference]: Start difference. First operand 863 states and 1236 transitions. Second operand 21 states. [2019-09-10 07:25:46,059 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:25:46,600 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:25:46,771 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:25:46,979 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:25:47,226 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:25:47,373 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:25:47,510 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:25:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:49,846 INFO L93 Difference]: Finished difference Result 4106 states and 6016 transitions. [2019-09-10 07:25:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:25:49,846 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-10 07:25:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:49,863 INFO L225 Difference]: With dead ends: 4106 [2019-09-10 07:25:49,863 INFO L226 Difference]: Without dead ends: 4106 [2019-09-10 07:25:49,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:25:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-10 07:25:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 863. [2019-09-10 07:25:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-10 07:25:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1235 transitions. [2019-09-10 07:25:49,925 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1235 transitions. Word has length 60 [2019-09-10 07:25:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:49,926 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1235 transitions. [2019-09-10 07:25:49,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:25:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1235 transitions. [2019-09-10 07:25:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:49,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:49,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:49,927 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 439557614, now seen corresponding path program 1 times [2019-09-10 07:25:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:49,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:50,715 INFO L134 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:25:50,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:50,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:25:50,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:50,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:25:50,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:25:50,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:25:50,717 INFO L87 Difference]: Start difference. First operand 863 states and 1235 transitions. Second operand 17 states. [2019-09-10 07:25:51,215 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:25:51,376 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:25:51,639 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 07:25:51,792 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:25:51,948 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:25:52,160 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:25:52,351 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:25:52,511 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:25:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:53,334 INFO L93 Difference]: Finished difference Result 2391 states and 3484 transitions. [2019-09-10 07:25:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:25:53,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-10 07:25:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:53,344 INFO L225 Difference]: With dead ends: 2391 [2019-09-10 07:25:53,344 INFO L226 Difference]: Without dead ends: 2391 [2019-09-10 07:25:53,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:25:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-10 07:25:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 858. [2019-09-10 07:25:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-10 07:25:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1226 transitions. [2019-09-10 07:25:53,372 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1226 transitions. Word has length 60 [2019-09-10 07:25:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:53,373 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1226 transitions. [2019-09-10 07:25:53,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:25:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1226 transitions. [2019-09-10 07:25:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:25:53,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:53,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,374 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1535867814, now seen corresponding path program 1 times [2019-09-10 07:25:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:53,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:53,949 INFO L134 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:25:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:25:53,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:53,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:25:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:25:53,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:25:53,952 INFO L87 Difference]: Start difference. First operand 858 states and 1226 transitions. Second operand 14 states. [2019-09-10 07:25:54,414 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:25:54,606 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:25:54,819 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:25:54,968 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:25:55,306 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:25:55,664 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 07:25:56,144 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:25:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:56,252 INFO L93 Difference]: Finished difference Result 2603 states and 3804 transitions. [2019-09-10 07:25:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:25:56,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-10 07:25:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:56,264 INFO L225 Difference]: With dead ends: 2603 [2019-09-10 07:25:56,264 INFO L226 Difference]: Without dead ends: 2603 [2019-09-10 07:25:56,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:25:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-09-10 07:25:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 830. [2019-09-10 07:25:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-10 07:25:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1190 transitions. [2019-09-10 07:25:56,294 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1190 transitions. Word has length 61 [2019-09-10 07:25:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:56,295 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1190 transitions. [2019-09-10 07:25:56,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:25:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1190 transitions. [2019-09-10 07:25:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:25:56,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:56,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:56,296 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 19025890, now seen corresponding path program 1 times [2019-09-10 07:25:56,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,793 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 07:25:57,168 INFO L134 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:25:57,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:57,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:25:57,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:57,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:25:57,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:25:57,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:57,173 INFO L87 Difference]: Start difference. First operand 830 states and 1190 transitions. Second operand 15 states. [2019-09-10 07:25:57,725 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:25:57,953 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 07:25:58,102 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-09-10 07:25:58,357 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-10 07:25:58,796 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-09-10 07:25:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:59,464 INFO L93 Difference]: Finished difference Result 4235 states and 6220 transitions. [2019-09-10 07:25:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:25:59,464 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-09-10 07:25:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:59,480 INFO L225 Difference]: With dead ends: 4235 [2019-09-10 07:25:59,481 INFO L226 Difference]: Without dead ends: 4235 [2019-09-10 07:25:59,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:25:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2019-09-10 07:25:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 822. [2019-09-10 07:25:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-09-10 07:25:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1178 transitions. [2019-09-10 07:25:59,520 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1178 transitions. Word has length 61 [2019-09-10 07:25:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:59,521 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1178 transitions. [2019-09-10 07:25:59,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:25:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1178 transitions. [2019-09-10 07:25:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:25:59,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:59,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,522 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash -447846175, now seen corresponding path program 1 times [2019-09-10 07:25:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:59,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:59,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:59,993 INFO L134 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:25:59,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:59,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:25:59,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:59,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:25:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:25:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:59,997 INFO L87 Difference]: Start difference. First operand 822 states and 1178 transitions. Second operand 12 states. [2019-09-10 07:26:00,420 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:26:00,586 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:26:00,764 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:26:01,104 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:26:01,351 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:26:01,507 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:26:01,967 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:26:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:02,047 INFO L93 Difference]: Finished difference Result 3722 states and 5461 transitions. [2019-09-10 07:26:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:26:02,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 07:26:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:02,060 INFO L225 Difference]: With dead ends: 3722 [2019-09-10 07:26:02,060 INFO L226 Difference]: Without dead ends: 3722 [2019-09-10 07:26:02,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:26:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-10 07:26:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 811. [2019-09-10 07:26:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-10 07:26:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1164 transitions. [2019-09-10 07:26:02,095 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1164 transitions. Word has length 61 [2019-09-10 07:26:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:02,095 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1164 transitions. [2019-09-10 07:26:02,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:26:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1164 transitions. [2019-09-10 07:26:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:26:02,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:02,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:02,096 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 626489158, now seen corresponding path program 1 times [2019-09-10 07:26:02,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:02,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:02,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:03,051 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:26:03,519 INFO L134 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:26:03,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:03,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:26:03,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:03,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:26:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:26:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:26:03,521 INFO L87 Difference]: Start difference. First operand 811 states and 1164 transitions. Second operand 20 states. [2019-09-10 07:26:04,187 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 07:26:04,331 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:26:04,522 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:26:04,833 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:26:05,012 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:26:05,206 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:26:05,510 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:26:05,868 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:26:06,046 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:26:06,225 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:26:06,405 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:26:07,054 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:26:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:07,636 INFO L93 Difference]: Finished difference Result 2797 states and 4097 transitions. [2019-09-10 07:26:07,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:26:07,636 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2019-09-10 07:26:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:07,644 INFO L225 Difference]: With dead ends: 2797 [2019-09-10 07:26:07,644 INFO L226 Difference]: Without dead ends: 2797 [2019-09-10 07:26:07,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:26:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2019-09-10 07:26:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 811. [2019-09-10 07:26:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-10 07:26:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1163 transitions. [2019-09-10 07:26:07,671 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1163 transitions. Word has length 61 [2019-09-10 07:26:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:07,671 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1163 transitions. [2019-09-10 07:26:07,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:26:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1163 transitions. [2019-09-10 07:26:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 07:26:07,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:07,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:07,673 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1538298394, now seen corresponding path program 1 times [2019-09-10 07:26:07,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:07,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:08,255 INFO L134 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:26:08,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:26:08,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:08,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:26:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:26:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:26:08,257 INFO L87 Difference]: Start difference. First operand 811 states and 1163 transitions. Second operand 16 states. [2019-09-10 07:26:08,929 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:26:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,286 INFO L93 Difference]: Finished difference Result 2989 states and 4380 transitions. [2019-09-10 07:26:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:26:10,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-09-10 07:26:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:10,295 INFO L225 Difference]: With dead ends: 2989 [2019-09-10 07:26:10,295 INFO L226 Difference]: Without dead ends: 2980 [2019-09-10 07:26:10,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:26:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-09-10 07:26:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 792. [2019-09-10 07:26:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-10 07:26:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1143 transitions. [2019-09-10 07:26:10,323 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1143 transitions. Word has length 62 [2019-09-10 07:26:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:10,323 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1143 transitions. [2019-09-10 07:26:10,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:26:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1143 transitions. [2019-09-10 07:26:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:26:10,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:10,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,325 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 845611540, now seen corresponding path program 1 times [2019-09-10 07:26:10,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:10,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:10,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:10,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:10,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:10,377 INFO L87 Difference]: Start difference. First operand 792 states and 1143 transitions. Second operand 3 states. [2019-09-10 07:26:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,419 INFO L93 Difference]: Finished difference Result 1394 states and 1981 transitions. [2019-09-10 07:26:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:26:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:10,423 INFO L225 Difference]: With dead ends: 1394 [2019-09-10 07:26:10,423 INFO L226 Difference]: Without dead ends: 1394 [2019-09-10 07:26:10,424 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:26:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-09-10 07:26:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1392. [2019-09-10 07:26:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-09-10 07:26:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1980 transitions. [2019-09-10 07:26:10,444 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1980 transitions. Word has length 80 [2019-09-10 07:26:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:10,445 INFO L475 AbstractCegarLoop]: Abstraction has 1392 states and 1980 transitions. [2019-09-10 07:26:10,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1980 transitions. [2019-09-10 07:26:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:26:10,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:10,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,447 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 801494317, now seen corresponding path program 1 times [2019-09-10 07:26:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:10,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:10,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:10,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:10,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:10,507 INFO L87 Difference]: Start difference. First operand 1392 states and 1980 transitions. Second operand 3 states. [2019-09-10 07:26:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,535 INFO L93 Difference]: Finished difference Result 2562 states and 3589 transitions. [2019-09-10 07:26:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:10,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:26:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:10,541 INFO L225 Difference]: With dead ends: 2562 [2019-09-10 07:26:10,541 INFO L226 Difference]: Without dead ends: 2562 [2019-09-10 07:26:10,541 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:26:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2019-09-10 07:26:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2416. [2019-09-10 07:26:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-09-10 07:26:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3408 transitions. [2019-09-10 07:26:10,575 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3408 transitions. Word has length 81 [2019-09-10 07:26:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:10,575 INFO L475 AbstractCegarLoop]: Abstraction has 2416 states and 3408 transitions. [2019-09-10 07:26:10,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3408 transitions. [2019-09-10 07:26:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:26:10,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:10,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:10,577 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 955833769, now seen corresponding path program 1 times [2019-09-10 07:26:10,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:10,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:10,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:10,637 INFO L87 Difference]: Start difference. First operand 2416 states and 3408 transitions. Second operand 3 states. [2019-09-10 07:26:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,665 INFO L93 Difference]: Finished difference Result 3890 states and 5405 transitions. [2019-09-10 07:26:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:10,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:26:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:10,675 INFO L225 Difference]: With dead ends: 3890 [2019-09-10 07:26:10,675 INFO L226 Difference]: Without dead ends: 3890 [2019-09-10 07:26:10,676 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:26:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-09-10 07:26:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3616. [2019-09-10 07:26:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3616 states. [2019-09-10 07:26:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 5030 transitions. [2019-09-10 07:26:10,739 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 5030 transitions. Word has length 82 [2019-09-10 07:26:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:10,739 INFO L475 AbstractCegarLoop]: Abstraction has 3616 states and 5030 transitions. [2019-09-10 07:26:10,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 5030 transitions. [2019-09-10 07:26:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:26:10,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:10,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,741 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1715394677, now seen corresponding path program 1 times [2019-09-10 07:26:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:10,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:10,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:10,804 INFO L87 Difference]: Start difference. First operand 3616 states and 5030 transitions. Second operand 3 states. [2019-09-10 07:26:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,833 INFO L93 Difference]: Finished difference Result 3734 states and 5135 transitions. [2019-09-10 07:26:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:10,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:26:10,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:10,841 INFO L225 Difference]: With dead ends: 3734 [2019-09-10 07:26:10,842 INFO L226 Difference]: Without dead ends: 3734 [2019-09-10 07:26:10,842 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:26:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-09-10 07:26:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3732. [2019-09-10 07:26:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-09-10 07:26:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5134 transitions. [2019-09-10 07:26:10,903 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5134 transitions. Word has length 83 [2019-09-10 07:26:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:10,903 INFO L475 AbstractCegarLoop]: Abstraction has 3732 states and 5134 transitions. [2019-09-10 07:26:10,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5134 transitions. [2019-09-10 07:26:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:26:10,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:10,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:10,905 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1787912455, now seen corresponding path program 1 times [2019-09-10 07:26:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:10,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,998 INFO L134 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:26:10,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:11,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:26:11,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:11,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:26:11,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:26:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:26:11,002 INFO L87 Difference]: Start difference. First operand 3732 states and 5134 transitions. Second operand 6 states. [2019-09-10 07:26:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:11,097 INFO L93 Difference]: Finished difference Result 5774 states and 7821 transitions. [2019-09-10 07:26:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:26:11,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:26:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:11,110 INFO L225 Difference]: With dead ends: 5774 [2019-09-10 07:26:11,110 INFO L226 Difference]: Without dead ends: 5774 [2019-09-10 07:26:11,111 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:26:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-09-10 07:26:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3828. [2019-09-10 07:26:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3828 states. [2019-09-10 07:26:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5198 transitions. [2019-09-10 07:26:11,180 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5198 transitions. Word has length 83 [2019-09-10 07:26:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:11,180 INFO L475 AbstractCegarLoop]: Abstraction has 3828 states and 5198 transitions. [2019-09-10 07:26:11,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:26:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5198 transitions. [2019-09-10 07:26:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:26:11,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:11,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,182 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1801937696, now seen corresponding path program 1 times [2019-09-10 07:26:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:11,280 INFO L134 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:26:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:11,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:11,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:11,282 INFO L87 Difference]: Start difference. First operand 3828 states and 5198 transitions. Second operand 7 states. [2019-09-10 07:26:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:11,636 INFO L93 Difference]: Finished difference Result 8694 states and 11555 transitions. [2019-09-10 07:26:11,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:26:11,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:26:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:11,657 INFO L225 Difference]: With dead ends: 8694 [2019-09-10 07:26:11,657 INFO L226 Difference]: Without dead ends: 8694 [2019-09-10 07:26:11,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:26:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8694 states. [2019-09-10 07:26:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8694 to 4440. [2019-09-10 07:26:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2019-09-10 07:26:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6048 transitions. [2019-09-10 07:26:11,800 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6048 transitions. Word has length 84 [2019-09-10 07:26:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:11,800 INFO L475 AbstractCegarLoop]: Abstraction has 4440 states and 6048 transitions. [2019-09-10 07:26:11,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6048 transitions. [2019-09-10 07:26:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:26:11,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:11,803 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] [2019-09-10 07:26:11,803 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1416144859, now seen corresponding path program 1 times [2019-09-10 07:26:11,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:11,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:12,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:12,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:12,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 07:26:12,084 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [176], [178], [181], [189], [191], [194], [202], [204], [207], [210], [214], [216], [218], [221], [222], [224], [226], [231], [233], [236], [249], [251], [254], [257], [259], [274], [299], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:26:12,139 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:12,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:12,272 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:12,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:12,872 INFO L272 AbstractInterpreter]: Visited 93 different actions 455 times. Merged at 34 different actions 318 times. Widened at 15 different actions 53 times. Performed 1697 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1697 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 14 different actions. Largest state had 118 variables. [2019-09-10 07:26:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:12,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:12,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:12,880 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:26:12,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:12,899 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:26:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:13,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:26:13,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:26:13,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:26:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:26:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [11] total 16 [2019-09-10 07:26:13,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:13,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:26:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:26:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:26:13,242 INFO L87 Difference]: Start difference. First operand 4440 states and 6048 transitions. Second operand 5 states. [2019-09-10 07:26:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:13,374 INFO L93 Difference]: Finished difference Result 8154 states and 10779 transitions. [2019-09-10 07:26:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:13,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:26:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:13,396 INFO L225 Difference]: With dead ends: 8154 [2019-09-10 07:26:13,396 INFO L226 Difference]: Without dead ends: 8154 [2019-09-10 07:26:13,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:26:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states. [2019-09-10 07:26:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 7292. [2019-09-10 07:26:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-09-10 07:26:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9706 transitions. [2019-09-10 07:26:13,572 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9706 transitions. Word has length 104 [2019-09-10 07:26:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:13,572 INFO L475 AbstractCegarLoop]: Abstraction has 7292 states and 9706 transitions. [2019-09-10 07:26:13,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:26:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9706 transitions. [2019-09-10 07:26:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:13,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:13,576 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] [2019-09-10 07:26:13,576 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1790019568, now seen corresponding path program 1 times [2019-09-10 07:26:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:13,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:14,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:14,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:14,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:26:14,034 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [176], [178], [181], [189], [191], [194], [202], [204], [207], [210], [214], [216], [218], [221], [222], [224], [226], [231], [233], [236], [249], [251], [254], [257], [259], [274], [276], [279], [282], [284], [299], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:26:14,042 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:14,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:14,069 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:14,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:14,504 INFO L272 AbstractInterpreter]: Visited 97 different actions 510 times. Merged at 38 different actions 355 times. Widened at 16 different actions 66 times. Performed 1864 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1864 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 62 fixpoints after 18 different actions. Largest state had 119 variables. [2019-09-10 07:26:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:14,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:14,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:26:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:14,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:14,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 07:26:14,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:26:14,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:26:15,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 7] total 21 [2019-09-10 07:26:15,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:15,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:26:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:26:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:26:15,162 INFO L87 Difference]: Start difference. First operand 7292 states and 9706 transitions. Second operand 16 states. [2019-09-10 07:26:25,033 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:26:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:25,186 INFO L93 Difference]: Finished difference Result 38220 states and 49736 transitions. [2019-09-10 07:26:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 07:26:25,186 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-10 07:26:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:25,263 INFO L225 Difference]: With dead ends: 38220 [2019-09-10 07:26:25,263 INFO L226 Difference]: Without dead ends: 38220 [2019-09-10 07:26:25,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1701, Invalid=8199, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 07:26:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38220 states. [2019-09-10 07:26:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38220 to 18582. [2019-09-10 07:26:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18582 states. [2019-09-10 07:26:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18582 states to 18582 states and 24709 transitions. [2019-09-10 07:26:25,674 INFO L78 Accepts]: Start accepts. Automaton has 18582 states and 24709 transitions. Word has length 105 [2019-09-10 07:26:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:25,674 INFO L475 AbstractCegarLoop]: Abstraction has 18582 states and 24709 transitions. [2019-09-10 07:26:25,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:26:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 18582 states and 24709 transitions. [2019-09-10 07:26:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:25,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:25,683 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:25,683 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash 676684956, now seen corresponding path program 1 times [2019-09-10 07:26:25,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:25,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:25,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:26,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:26,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:26,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:26:26,014 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [274], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:26:26,027 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:26,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:26,055 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:26,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:26,313 INFO L272 AbstractInterpreter]: Visited 99 different actions 418 times. Merged at 40 different actions 282 times. Widened at 10 different actions 30 times. Performed 1599 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1599 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 11 different actions. Largest state had 119 variables. [2019-09-10 07:26:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:26,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:26,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:26,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:26:26,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:26,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:26:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:26,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:26:26,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:26,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:27,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:29,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:26:29,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:29,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:26:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:26:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:26:29,774 INFO L87 Difference]: Start difference. First operand 18582 states and 24709 transitions. Second operand 18 states. [2019-09-10 07:26:30,206 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:26:30,456 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:26:30,748 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:26:31,558 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:26:31,744 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:26:31,985 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:32,248 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:32,622 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:32,950 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:26:33,125 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:33,344 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:33,631 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:33,809 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:26:34,302 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:26:34,661 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:26:35,271 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:26:35,654 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:35,882 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:36,120 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:26:36,467 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:26:36,597 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 07:26:37,018 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:37,174 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:37,423 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:26:37,742 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:38,069 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:26:38,263 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:26:38,542 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 07:26:38,894 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:39,143 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:26:39,567 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 07:26:39,789 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:26:39,998 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:26:40,251 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:26:40,705 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:26:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:40,879 INFO L93 Difference]: Finished difference Result 65454 states and 84646 transitions. [2019-09-10 07:26:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:26:40,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2019-09-10 07:26:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:41,005 INFO L225 Difference]: With dead ends: 65454 [2019-09-10 07:26:41,013 INFO L226 Difference]: Without dead ends: 65454 [2019-09-10 07:26:41,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 171 SyntacticMatches, 30 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1138, Invalid=3832, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:26:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65454 states. [2019-09-10 07:26:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65454 to 32370. [2019-09-10 07:26:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32370 states. [2019-09-10 07:26:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32370 states to 32370 states and 42729 transitions. [2019-09-10 07:26:41,591 INFO L78 Accepts]: Start accepts. Automaton has 32370 states and 42729 transitions. Word has length 106 [2019-09-10 07:26:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:41,591 INFO L475 AbstractCegarLoop]: Abstraction has 32370 states and 42729 transitions. [2019-09-10 07:26:41,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:26:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32370 states and 42729 transitions. [2019-09-10 07:26:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:41,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:41,598 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:41,598 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1985676566, now seen corresponding path program 1 times [2019-09-10 07:26:41,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:41,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:41,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:26:41,937 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [299], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:26:41,942 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:41,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:41,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:42,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:42,380 INFO L272 AbstractInterpreter]: Visited 99 different actions 477 times. Merged at 40 different actions 335 times. Widened at 12 different actions 45 times. Performed 1713 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1713 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 10 different actions. Largest state had 119 variables. [2019-09-10 07:26:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:42,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:42,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:42,382 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:26:42,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:42,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:43,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:26:43,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:43,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:43,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:44,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:44,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:44,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:44,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:26:53,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:53,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:26:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:26:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:26:53,373 INFO L87 Difference]: Start difference. First operand 32370 states and 42729 transitions. Second operand 20 states. [2019-09-10 07:26:57,017 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:26:57,190 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:26:57,588 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:26:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:58,801 INFO L93 Difference]: Finished difference Result 128488 states and 166923 transitions. [2019-09-10 07:26:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:26:58,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:26:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:58,999 INFO L225 Difference]: With dead ends: 128488 [2019-09-10 07:26:59,000 INFO L226 Difference]: Without dead ends: 128488 [2019-09-10 07:26:59,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 167 SyntacticMatches, 32 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=836, Invalid=2244, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:26:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128488 states. [2019-09-10 07:27:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128488 to 69097. [2019-09-10 07:27:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69097 states. [2019-09-10 07:27:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69097 states to 69097 states and 90650 transitions. [2019-09-10 07:27:00,166 INFO L78 Accepts]: Start accepts. Automaton has 69097 states and 90650 transitions. Word has length 106 [2019-09-10 07:27:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:00,166 INFO L475 AbstractCegarLoop]: Abstraction has 69097 states and 90650 transitions. [2019-09-10 07:27:00,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:27:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 69097 states and 90650 transitions. [2019-09-10 07:27:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:27:00,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:00,180 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] [2019-09-10 07:27:00,180 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1486306068, now seen corresponding path program 1 times [2019-09-10 07:27:00,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:00,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:00,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:00,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:00,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:27:00,600 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [299], [301], [304], [307], [309], [328], [333], [390], [391], [395], [396], [397] [2019-09-10 07:27:00,603 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:00,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:00,617 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:00,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:27:00,897 INFO L272 AbstractInterpreter]: Visited 100 different actions 487 times. Merged at 40 different actions 342 times. Widened at 14 different actions 50 times. Performed 1849 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1849 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 10 different actions. Largest state had 119 variables. [2019-09-10 07:27:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:00,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:27:00,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:00,897 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:27:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:00,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:27:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:01,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:27:01,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:27:01,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:05,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:27:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:27:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 07:27:08,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:27:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:27:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:27:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=857, Unknown=2, NotChecked=0, Total=992 [2019-09-10 07:27:08,384 INFO L87 Difference]: Start difference. First operand 69097 states and 90650 transitions. Second operand 22 states. [2019-09-10 07:27:15,786 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-09-10 07:27:19,409 WARN L188 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-09-10 07:27:26,807 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-09-10 07:27:27,260 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-09-10 07:27:27,564 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:27:27,788 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-09-10 07:27:28,331 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:27:33,493 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-09-10 07:27:36,970 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2019-09-10 07:27:40,306 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-09-10 07:27:41,510 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 07:27:42,936 WARN L188 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-10 07:27:43,408 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:27:49,428 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:27:50,372 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 07:27:52,215 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 07:27:52,998 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 07:27:53,605 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-09-10 07:27:54,293 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-09-10 07:27:54,825 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:27:57,333 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-09-10 07:27:58,278 WARN L188 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 07:27:59,059 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-09-10 07:27:59,467 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:28:00,285 WARN L188 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 07:28:01,071 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:28:01,530 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2019-09-10 07:28:03,323 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:28:03,942 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-09-10 07:28:04,573 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 07:28:04,977 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-09-10 07:28:05,592 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 07:28:06,293 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-09-10 07:28:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:14,434 INFO L93 Difference]: Finished difference Result 196467 states and 255635 transitions. [2019-09-10 07:28:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 07:28:14,435 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-09-10 07:28:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:14,728 INFO L225 Difference]: With dead ends: 196467 [2019-09-10 07:28:14,728 INFO L226 Difference]: Without dead ends: 196467 [2019-09-10 07:28:14,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 169 SyntacticMatches, 27 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2630 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=1645, Invalid=6185, Unknown=2, NotChecked=0, Total=7832 [2019-09-10 07:28:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196467 states. [2019-09-10 07:28:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196467 to 69079. [2019-09-10 07:28:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69079 states. [2019-09-10 07:28:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69079 states to 69079 states and 90632 transitions. [2019-09-10 07:28:16,111 INFO L78 Accepts]: Start accepts. Automaton has 69079 states and 90632 transitions. Word has length 107 [2019-09-10 07:28:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:16,111 INFO L475 AbstractCegarLoop]: Abstraction has 69079 states and 90632 transitions. [2019-09-10 07:28:16,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:28:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 69079 states and 90632 transitions. [2019-09-10 07:28:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:28:16,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:16,119 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] [2019-09-10 07:28:16,120 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1432148257, now seen corresponding path program 1 times [2019-09-10 07:28:16,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:16,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:16,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:28:16,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:16,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:28:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:28:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:16,181 INFO L87 Difference]: Start difference. First operand 69079 states and 90632 transitions. Second operand 3 states. [2019-09-10 07:28:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:16,350 INFO L93 Difference]: Finished difference Result 66901 states and 85329 transitions. [2019-09-10 07:28:16,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:28:16,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 07:28:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:16,711 INFO L225 Difference]: With dead ends: 66901 [2019-09-10 07:28:16,711 INFO L226 Difference]: Without dead ends: 66901 [2019-09-10 07:28:16,712 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:28:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66901 states. [2019-09-10 07:28:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66901 to 65189. [2019-09-10 07:28:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65189 states. [2019-09-10 07:28:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65189 states to 65189 states and 83618 transitions. [2019-09-10 07:28:17,221 INFO L78 Accepts]: Start accepts. Automaton has 65189 states and 83618 transitions. Word has length 107 [2019-09-10 07:28:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:17,221 INFO L475 AbstractCegarLoop]: Abstraction has 65189 states and 83618 transitions. [2019-09-10 07:28:17,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:28:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 65189 states and 83618 transitions. [2019-09-10 07:28:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:28:17,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:17,228 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] [2019-09-10 07:28:17,228 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash -203302559, now seen corresponding path program 1 times [2019-09-10 07:28:17,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:17,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:17,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:17,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:28:17,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:28:17,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:28:17,824 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:28:17,827 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:28:17,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:28:17,841 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:28:18,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:28:18,055 INFO L272 AbstractInterpreter]: Visited 100 different actions 413 times. Merged at 41 different actions 277 times. Widened at 9 different actions 28 times. Performed 1531 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1531 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 11 different actions. Largest state had 119 variables. [2019-09-10 07:28:18,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:18,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:28:18,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:28:18,056 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:28:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:18,072 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:28:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:18,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 07:28:18,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:28:19,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:19,496 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 07:28:19,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:19,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:20,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:28:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:20,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:21,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:21,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:21,970 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 07:28:22,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:28:22,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:22,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:22,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:28:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:28:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:24,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:28:24,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 16] total 50 [2019-09-10 07:28:24,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:28:24,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:28:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:28:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:28:24,834 INFO L87 Difference]: Start difference. First operand 65189 states and 83618 transitions. Second operand 36 states. [2019-09-10 07:28:26,863 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:28:27,145 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:28:27,432 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:28:28,376 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:28:30,173 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:28:30,410 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:28:30,856 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:28:31,176 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:28:32,295 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:28:33,536 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:28:35,785 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:28:36,845 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:28:37,160 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 07:28:38,488 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:28:40,128 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 07:28:42,521 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:28:44,067 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:28:44,741 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 07:28:45,266 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:28:47,401 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:28:50,723 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:28:51,661 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:28:51,988 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:28:58,732 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:28:59,160 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:29:00,383 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:29:00,869 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:29:01,107 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:29:05,209 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:29:06,174 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:29:08,087 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:29:08,643 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:29:12,000 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:29:12,297 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:29:12,581 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:29:15,676 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:29:20,570 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:29:21,857 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:29:23,133 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 07:29:24,047 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:29:24,503 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:29:25,108 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:29:26,107 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:29:26,865 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:29:27,850 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:29:28,952 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:29:29,514 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:29:30,096 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 07:29:32,373 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:29:37,528 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 07:29:38,392 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:29:43,494 WARN L188 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:29:45,174 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:29:46,135 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:29:52,966 WARN L188 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:29:53,483 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:29:54,865 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:29:56,146 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:29:56,910 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:29:59,507 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:30:00,045 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:30:01,374 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:30:02,366 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:30:03,292 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:30:04,965 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:30:05,476 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:30:05,769 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:30:06,814 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:30:07,839 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:30:09,239 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:30:10,036 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 07:30:14,113 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:30:17,129 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:30:34,561 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:30:35,881 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 07:30:36,750 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:30:38,880 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:30:39,552 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 07:30:41,815 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:30:44,836 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:30:45,054 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:30:45,465 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:30:45,820 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:30:46,172 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:30:46,915 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:30:48,324 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 07:30:51,061 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:30:53,371 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:30:58,252 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:31:01,696 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:31:02,368 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:31:03,455 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:31:05,052 WARN L188 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:31:08,977 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:31:10,113 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:31:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:10,256 INFO L93 Difference]: Finished difference Result 254756 states and 323467 transitions. [2019-09-10 07:31:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-10 07:31:10,257 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2019-09-10 07:31:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:10,879 INFO L225 Difference]: With dead ends: 254756 [2019-09-10 07:31:10,879 INFO L226 Difference]: Without dead ends: 254756 [2019-09-10 07:31:10,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 160 SyntacticMatches, 26 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 106.1s TimeCoverageRelationStatistics Valid=4610, Invalid=36802, Unknown=0, NotChecked=0, Total=41412 [2019-09-10 07:31:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254756 states. [2019-09-10 07:31:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254756 to 122007. [2019-09-10 07:31:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122007 states. [2019-09-10 07:31:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122007 states to 122007 states and 156634 transitions. [2019-09-10 07:31:15,251 INFO L78 Accepts]: Start accepts. Automaton has 122007 states and 156634 transitions. Word has length 107 [2019-09-10 07:31:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:15,251 INFO L475 AbstractCegarLoop]: Abstraction has 122007 states and 156634 transitions. [2019-09-10 07:31:15,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:31:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 122007 states and 156634 transitions. [2019-09-10 07:31:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:31:15,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:15,257 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] [2019-09-10 07:31:15,258 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -7673960, now seen corresponding path program 1 times [2019-09-10 07:31:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:15,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:15,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:15,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:15,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:31:15,775 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [274], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:31:15,776 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:15,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:15,791 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:15,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:15,927 INFO L272 AbstractInterpreter]: Visited 100 different actions 326 times. Merged at 40 different actions 198 times. Widened at 7 different actions 12 times. Performed 1282 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1282 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 9 different actions. Largest state had 119 variables. [2019-09-10 07:31:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:15,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:15,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:15,928 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:31:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:15,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:16,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 07:31:16,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:16,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:16,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 39 [2019-09-10 07:31:17,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:17,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:31:17,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:31:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1321, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:31:17,715 INFO L87 Difference]: Start difference. First operand 122007 states and 156634 transitions. Second operand 30 states. [2019-09-10 07:31:17,869 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:31:19,255 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:31:19,762 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:31:20,152 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:31:20,488 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:31:21,071 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:31:21,791 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:31:21,993 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:22,454 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:31:22,989 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:31:23,445 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:31:23,627 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:31:23,892 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:31:25,963 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:31:26,670 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:31:26,923 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:31:27,145 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:31:27,476 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:31:27,933 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:31:28,304 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:31:28,460 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:31:29,104 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:31:29,494 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:31:29,779 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:31:30,270 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:31:30,825 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:31:31,136 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:31:31,670 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:31:32,050 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:32,267 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:33,142 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:31:33,430 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:31:33,618 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:33,916 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 07:31:34,848 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:31:35,200 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:31:35,398 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:31:35,920 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:31:36,444 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:31:36,893 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:31:37,145 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:31:37,714 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:31:37,936 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:31:38,115 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:31:38,499 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 07:31:39,354 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:31:39,922 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 07:31:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:40,828 INFO L93 Difference]: Finished difference Result 395682 states and 501077 transitions. [2019-09-10 07:31:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 07:31:40,828 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 107 [2019-09-10 07:31:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:41,339 INFO L225 Difference]: With dead ends: 395682 [2019-09-10 07:31:41,339 INFO L226 Difference]: Without dead ends: 395682 [2019-09-10 07:31:41,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7792 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4612, Invalid=19880, Unknown=0, NotChecked=0, Total=24492 [2019-09-10 07:31:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395682 states. [2019-09-10 07:31:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395682 to 137409. [2019-09-10 07:31:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137409 states. [2019-09-10 07:31:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137409 states to 137409 states and 175988 transitions. [2019-09-10 07:31:44,518 INFO L78 Accepts]: Start accepts. Automaton has 137409 states and 175988 transitions. Word has length 107 [2019-09-10 07:31:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:44,519 INFO L475 AbstractCegarLoop]: Abstraction has 137409 states and 175988 transitions. [2019-09-10 07:31:44,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:31:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137409 states and 175988 transitions. [2019-09-10 07:31:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:31:44,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:44,526 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:31:44,526 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:44,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1201443546, now seen corresponding path program 1 times [2019-09-10 07:31:44,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:44,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:44,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:44,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:44,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:31:44,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:44,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:31:44,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:31:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:44,587 INFO L87 Difference]: Start difference. First operand 137409 states and 175988 transitions. Second operand 3 states. [2019-09-10 07:31:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:44,808 INFO L93 Difference]: Finished difference Result 81507 states and 102162 transitions. [2019-09-10 07:31:44,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:31:44,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:31:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:44,895 INFO L225 Difference]: With dead ends: 81507 [2019-09-10 07:31:44,896 INFO L226 Difference]: Without dead ends: 81507 [2019-09-10 07:31:44,896 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:31:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81507 states. [2019-09-10 07:31:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81507 to 81505. [2019-09-10 07:31:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81505 states. [2019-09-10 07:31:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81505 states to 81505 states and 102161 transitions. [2019-09-10 07:31:48,342 INFO L78 Accepts]: Start accepts. Automaton has 81505 states and 102161 transitions. Word has length 108 [2019-09-10 07:31:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:48,342 INFO L475 AbstractCegarLoop]: Abstraction has 81505 states and 102161 transitions. [2019-09-10 07:31:48,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:31:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 81505 states and 102161 transitions. [2019-09-10 07:31:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:31:48,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:48,348 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:31:48,349 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -948055354, now seen corresponding path program 1 times [2019-09-10 07:31:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:48,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:31:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:31:48,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:48,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:31:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:31:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:48,395 INFO L87 Difference]: Start difference. First operand 81505 states and 102161 transitions. Second operand 3 states. [2019-09-10 07:31:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:48,596 INFO L93 Difference]: Finished difference Result 52377 states and 64748 transitions. [2019-09-10 07:31:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:31:48,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:31:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:48,669 INFO L225 Difference]: With dead ends: 52377 [2019-09-10 07:31:48,669 INFO L226 Difference]: Without dead ends: 52377 [2019-09-10 07:31:48,669 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:31:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52377 states. [2019-09-10 07:31:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52377 to 52377. [2019-09-10 07:31:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52377 states. [2019-09-10 07:31:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52377 states to 52377 states and 64748 transitions. [2019-09-10 07:31:49,223 INFO L78 Accepts]: Start accepts. Automaton has 52377 states and 64748 transitions. Word has length 108 [2019-09-10 07:31:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:49,223 INFO L475 AbstractCegarLoop]: Abstraction has 52377 states and 64748 transitions. [2019-09-10 07:31:49,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:31:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52377 states and 64748 transitions. [2019-09-10 07:31:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:31:49,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:49,227 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:49,228 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1790908899, now seen corresponding path program 1 times [2019-09-10 07:31:49,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:49,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:49,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:49,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:49,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:49,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:31:49,817 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [304], [307], [309], [390], [391], [395], [396], [397] [2019-09-10 07:31:49,820 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:49,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:49,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:50,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:50,117 INFO L272 AbstractInterpreter]: Visited 99 different actions 516 times. Merged at 40 different actions 370 times. Widened at 12 different actions 44 times. Performed 1944 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1944 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 42 fixpoints after 12 different actions. Largest state had 119 variables. [2019-09-10 07:31:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:50,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:50,118 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:50,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:50,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:31:50,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:50,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:51,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:51,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:52,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:52,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:52,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:53,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:54,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 52 [2019-09-10 07:31:54,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:54,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 07:31:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 07:31:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:31:54,376 INFO L87 Difference]: Start difference. First operand 52377 states and 64748 transitions. Second operand 38 states. [2019-09-10 07:31:54,597 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:31:56,190 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:31:56,425 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:31:56,760 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:31:57,041 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:31:59,945 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:32:00,425 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:32:01,465 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:32:01,823 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:32:02,141 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:32:02,412 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:32:08,046 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:32:13,439 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:32:18,393 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:32:19,000 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:32:20,589 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:32:21,039 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:32:21,522 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:32:22,274 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:32:32,540 WARN L188 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:32:35,826 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:32:36,645 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:32:39,493 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:32:44,039 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-10 07:32:56,809 WARN L188 SmtUtils]: Spent 5.94 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:33:06,509 WARN L188 SmtUtils]: Spent 7.85 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:33:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:10,058 INFO L93 Difference]: Finished difference Result 118290 states and 145681 transitions. [2019-09-10 07:33:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:33:10,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 108 [2019-09-10 07:33:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:33:10,180 INFO L225 Difference]: With dead ends: 118290 [2019-09-10 07:33:10,180 INFO L226 Difference]: Without dead ends: 118290 [2019-09-10 07:33:10,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 173 SyntacticMatches, 15 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=1284, Invalid=8028, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 07:33:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118290 states. [2019-09-10 07:33:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118290 to 61492. [2019-09-10 07:33:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61492 states. [2019-09-10 07:33:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61492 states to 61492 states and 75896 transitions. [2019-09-10 07:33:10,885 INFO L78 Accepts]: Start accepts. Automaton has 61492 states and 75896 transitions. Word has length 108 [2019-09-10 07:33:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:33:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 61492 states and 75896 transitions. [2019-09-10 07:33:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 07:33:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61492 states and 75896 transitions. [2019-09-10 07:33:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:33:10,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:33:10,890 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:33:10,890 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:33:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -268881277, now seen corresponding path program 1 times [2019-09-10 07:33:10,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:33:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:10,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:33:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:11,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:11,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:33:11,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:33:11,474 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [189], [191], [194], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [249], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [328], [333], [338], [343], [390], [391], [395], [396], [397] [2019-09-10 07:33:11,475 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:33:11,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:33:11,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:33:11,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:33:11,644 INFO L272 AbstractInterpreter]: Visited 101 different actions 427 times. Merged at 40 different actions 289 times. Widened at 10 different actions 29 times. Performed 1604 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1604 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 9 different actions. Largest state had 119 variables. [2019-09-10 07:33:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:11,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:33:11,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:11,644 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:33:11,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:11,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:33:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:11,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:33:11,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:33:11,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:11,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:11,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:12,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:33:12,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:12,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:33:12,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 07:33:12,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:33:12,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:33:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:33:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:33:12,582 INFO L87 Difference]: Start difference. First operand 61492 states and 75896 transitions. Second operand 19 states. [2019-09-10 07:33:15,945 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-10 07:33:16,267 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:33:16,554 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:33:17,348 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:33:17,627 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-09-10 07:33:19,072 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 07:33:19,232 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:33:20,861 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 07:33:21,336 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 07:33:21,509 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:33:21,841 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:33:22,024 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:33:22,181 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-09-10 07:33:25,589 WARN L188 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-09-10 07:33:25,916 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:33:26,281 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:33:26,911 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 07:33:27,493 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 07:33:29,626 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 07:33:29,842 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 07:33:30,017 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 07:33:30,457 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 07:33:31,488 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:33:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:33,043 INFO L93 Difference]: Finished difference Result 219095 states and 269251 transitions. [2019-09-10 07:33:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-10 07:33:33,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 108 [2019-09-10 07:33:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:33:33,287 INFO L225 Difference]: With dead ends: 219095 [2019-09-10 07:33:33,288 INFO L226 Difference]: Without dead ends: 219095 [2019-09-10 07:33:33,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6843 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3625, Invalid=18131, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 07:33:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219095 states. [2019-09-10 07:33:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219095 to 65791. [2019-09-10 07:33:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65791 states. [2019-09-10 07:33:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65791 states to 65791 states and 81215 transitions. [2019-09-10 07:33:34,769 INFO L78 Accepts]: Start accepts. Automaton has 65791 states and 81215 transitions. Word has length 108 [2019-09-10 07:33:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:33:34,769 INFO L475 AbstractCegarLoop]: Abstraction has 65791 states and 81215 transitions. [2019-09-10 07:33:34,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:33:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 65791 states and 81215 transitions. [2019-09-10 07:33:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:33:34,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:33:34,774 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:33:34,775 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:33:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 588978625, now seen corresponding path program 1 times [2019-09-10 07:33:34,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:33:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:34,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:34,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:33:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:35,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:35,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:33:35,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:33:35,307 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [304], [307], [309], [338], [343], [390], [391], [395], [396], [397] [2019-09-10 07:33:35,310 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:33:35,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:33:35,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:33:35,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:33:35,497 INFO L272 AbstractInterpreter]: Visited 101 different actions 422 times. Merged at 41 different actions 284 times. Widened at 10 different actions 34 times. Performed 1567 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1567 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 119 variables. [2019-09-10 07:33:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:35,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:33:35,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:33:35,498 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) [2019-09-10 07:33:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:33:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:35,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:33:35,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:33:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:36,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:33:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:33:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:33:36,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:33:36,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 40 [2019-09-10 07:33:36,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:33:36,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:33:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:33:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:33:36,699 INFO L87 Difference]: Start difference. First operand 65791 states and 81215 transitions. Second operand 30 states. [2019-09-10 07:33:36,915 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:33:37,719 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:33:38,254 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:33:54,281 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:33:54,696 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:33:57,231 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:33:59,807 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:00,012 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:34:00,401 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:34:05,225 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:05,451 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:34:10,163 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:34:17,000 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:34:21,562 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:34:21,942 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:34:22,954 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:23,402 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:34:23,802 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:34:24,388 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:25,358 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:34:25,994 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:34:26,313 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:34:27,533 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:34:28,320 WARN L188 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:34:29,005 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:34:31,484 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:34:31,702 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:34:32,230 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:34:35,156 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:34:35,343 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:34:35,809 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:36,020 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:34:38,409 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:34:41,159 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:34:41,822 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:34:42,148 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:34:43,108 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:34:43,625 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:34:44,093 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:34:46,097 WARN L188 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:34:46,687 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:47,377 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:34:48,095 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:34:48,763 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:34:49,449 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:34:49,783 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:34:50,355 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:34:50,723 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:34:50,967 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:34:51,710 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:34:52,337 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:34:52,606 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:34:53,193 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:34:55,797 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:34:56,031 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:34:57,098 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:34:57,801 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:34:58,053 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:58,295 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:34:59,137 WARN L188 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:34:59,612 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:35:02,528 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:35:02,909 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 07:35:03,107 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:35:05,413 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:35:07,588 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:35:07,947 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:35:08,287 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:35:08,704 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:35:09,077 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:35:09,518 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 07:35:09,751 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:35:10,025 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 07:35:10,205 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 07:35:10,513 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:35:10,832 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:35:11,897 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:35:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:14,035 INFO L93 Difference]: Finished difference Result 177966 states and 219489 transitions. [2019-09-10 07:35:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-10 07:35:14,039 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2019-09-10 07:35:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:14,309 INFO L225 Difference]: With dead ends: 177966 [2019-09-10 07:35:14,310 INFO L226 Difference]: Without dead ends: 177966 [2019-09-10 07:35:14,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11237 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=4832, Invalid=30700, Unknown=0, NotChecked=0, Total=35532 [2019-09-10 07:35:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177966 states. [2019-09-10 07:35:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177966 to 76016. [2019-09-10 07:35:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76016 states. [2019-09-10 07:35:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76016 states to 76016 states and 93655 transitions. [2019-09-10 07:35:15,887 INFO L78 Accepts]: Start accepts. Automaton has 76016 states and 93655 transitions. Word has length 108 [2019-09-10 07:35:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:15,887 INFO L475 AbstractCegarLoop]: Abstraction has 76016 states and 93655 transitions. [2019-09-10 07:35:15,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:35:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76016 states and 93655 transitions. [2019-09-10 07:35:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:35:15,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:15,892 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:35:15,892 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016152, now seen corresponding path program 1 times [2019-09-10 07:35:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:15,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:16,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:16,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:35:16,168 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:35:16,169 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [299], [301], [304], [307], [309], [328], [333], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:35:16,173 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:35:16,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:35:16,185 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:35:16,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:35:16,409 INFO L272 AbstractInterpreter]: Visited 101 different actions 492 times. Merged at 40 different actions 348 times. Widened at 13 different actions 45 times. Performed 1824 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1824 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 8 different actions. Largest state had 119 variables. [2019-09-10 07:35:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:16,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:35:16,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:16,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:35:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:16,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:35:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:16,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:35:16,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:35:16,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:16,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:17,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:35:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:17,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:35:17,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2019-09-10 07:35:17,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:35:17,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:35:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:35:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:35:17,446 INFO L87 Difference]: Start difference. First operand 76016 states and 93655 transitions. Second operand 20 states. [2019-09-10 07:35:18,024 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:35:19,776 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-10 07:35:20,448 WARN L188 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:35:20,649 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:35:25,170 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-10 07:35:25,835 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 07:35:25,989 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 07:35:26,346 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:35:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:35:26,738 INFO L93 Difference]: Finished difference Result 146686 states and 179675 transitions. [2019-09-10 07:35:26,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 07:35:26,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-10 07:35:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:35:26,884 INFO L225 Difference]: With dead ends: 146686 [2019-09-10 07:35:26,884 INFO L226 Difference]: Without dead ends: 146686 [2019-09-10 07:35:26,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=902, Invalid=2880, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 07:35:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146686 states. [2019-09-10 07:35:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146686 to 76007. [2019-09-10 07:35:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76007 states. [2019-09-10 07:35:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76007 states to 76007 states and 93646 transitions. [2019-09-10 07:35:27,795 INFO L78 Accepts]: Start accepts. Automaton has 76007 states and 93646 transitions. Word has length 108 [2019-09-10 07:35:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:35:27,795 INFO L475 AbstractCegarLoop]: Abstraction has 76007 states and 93646 transitions. [2019-09-10 07:35:27,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:35:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76007 states and 93646 transitions. [2019-09-10 07:35:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:35:27,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:35:27,799 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:35:27,799 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:35:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash 56407525, now seen corresponding path program 1 times [2019-09-10 07:35:27,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:35:27,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:27,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:27,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:35:27,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:35:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:28,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:28,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:35:28,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:35:28,430 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:35:28,431 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:35:28,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:35:28,442 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:35:28,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:35:28,581 INFO L272 AbstractInterpreter]: Visited 101 different actions 391 times. Merged at 41 different actions 257 times. Widened at 10 different actions 23 times. Performed 1482 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1482 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 119 variables. [2019-09-10 07:35:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:35:28,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:35:28,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:35:28,581 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:35:28,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:35:28,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:35:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:35:28,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 07:35:28,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:35:29,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:29,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:29,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:29,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:30,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:35:32,440 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 07:35:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:35:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:35:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:35:36,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:35:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:35:36,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:35:36,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2019-09-10 07:35:36,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:35:36,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 07:35:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 07:35:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2694, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:35:36,794 INFO L87 Difference]: Start difference. First operand 76007 states and 93646 transitions. Second operand 38 states. [2019-09-10 07:35:38,577 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:35:38,890 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:35:39,157 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:35:39,559 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:35:39,998 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 07:35:42,582 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:35:44,096 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:35:47,031 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:35:50,381 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:35:50,832 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:35:54,689 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:35:59,153 WARN L188 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 07:36:00,790 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:36:01,447 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:36:09,313 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:36:10,605 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:36:11,332 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:36:13,160 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:36:14,225 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-10 07:36:14,934 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:36:19,189 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:36:19,827 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:36:21,781 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 07:36:24,313 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 07:36:24,741 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:36:26,267 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:36:27,715 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-09-10 07:36:30,631 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:36:32,151 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:36:33,274 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:36:34,414 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 07:36:38,598 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:36:41,078 WARN L188 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 07:36:42,075 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:36:42,539 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:36:43,264 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:36:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:44,072 INFO L93 Difference]: Finished difference Result 110483 states and 136084 transitions. [2019-09-10 07:36:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 07:36:44,072 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 108 [2019-09-10 07:36:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:44,172 INFO L225 Difference]: With dead ends: 110483 [2019-09-10 07:36:44,173 INFO L226 Difference]: Without dead ends: 110483 [2019-09-10 07:36:44,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 159 SyntacticMatches, 26 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=1468, Invalid=11188, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 07:36:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110483 states. [2019-09-10 07:36:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110483 to 66919. [2019-09-10 07:36:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66919 states. [2019-09-10 07:36:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66919 states to 66919 states and 82396 transitions. [2019-09-10 07:36:44,856 INFO L78 Accepts]: Start accepts. Automaton has 66919 states and 82396 transitions. Word has length 108 [2019-09-10 07:36:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:44,856 INFO L475 AbstractCegarLoop]: Abstraction has 66919 states and 82396 transitions. [2019-09-10 07:36:44,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 07:36:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 66919 states and 82396 transitions. [2019-09-10 07:36:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:36:44,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:44,860 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:44,860 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1623120293, now seen corresponding path program 1 times [2019-09-10 07:36:44,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:44,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:44,915 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:36:44,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:36:44,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:36:44,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:36:44,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:36:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:36:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:44,917 INFO L87 Difference]: Start difference. First operand 66919 states and 82396 transitions. Second operand 3 states. [2019-09-10 07:36:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:45,094 INFO L93 Difference]: Finished difference Result 57428 states and 69757 transitions. [2019-09-10 07:36:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:36:45,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:36:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:45,161 INFO L225 Difference]: With dead ends: 57428 [2019-09-10 07:36:45,162 INFO L226 Difference]: Without dead ends: 57428 [2019-09-10 07:36:45,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57428 states. [2019-09-10 07:36:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57428 to 57428. [2019-09-10 07:36:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57428 states. [2019-09-10 07:36:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57428 states to 57428 states and 69757 transitions. [2019-09-10 07:36:45,590 INFO L78 Accepts]: Start accepts. Automaton has 57428 states and 69757 transitions. Word has length 109 [2019-09-10 07:36:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:45,590 INFO L475 AbstractCegarLoop]: Abstraction has 57428 states and 69757 transitions. [2019-09-10 07:36:45,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:36:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 57428 states and 69757 transitions. [2019-09-10 07:36:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:36:45,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:45,593 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:45,593 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1270009372, now seen corresponding path program 1 times [2019-09-10 07:36:45,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:45,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:45,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:36:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:36:45,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:36:45,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:36:45,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:36:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:36:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:45,630 INFO L87 Difference]: Start difference. First operand 57428 states and 69757 transitions. Second operand 3 states. [2019-09-10 07:36:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:36:45,773 INFO L93 Difference]: Finished difference Result 40872 states and 48925 transitions. [2019-09-10 07:36:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:36:45,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:36:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:36:45,806 INFO L225 Difference]: With dead ends: 40872 [2019-09-10 07:36:45,806 INFO L226 Difference]: Without dead ends: 40872 [2019-09-10 07:36:45,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:36:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40872 states. [2019-09-10 07:36:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40872 to 40872. [2019-09-10 07:36:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40872 states. [2019-09-10 07:36:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40872 states to 40872 states and 48925 transitions. [2019-09-10 07:36:46,078 INFO L78 Accepts]: Start accepts. Automaton has 40872 states and 48925 transitions. Word has length 109 [2019-09-10 07:36:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:36:46,078 INFO L475 AbstractCegarLoop]: Abstraction has 40872 states and 48925 transitions. [2019-09-10 07:36:46,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:36:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40872 states and 48925 transitions. [2019-09-10 07:36:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:36:46,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:36:46,080 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:36:46,080 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:36:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1971904227, now seen corresponding path program 1 times [2019-09-10 07:36:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:36:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:36:46,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:36:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:46,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:46,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:36:46,601 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:36:46,602 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [119], [121], [124], [127], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [304], [307], [309], [328], [333], [338], [343], [390], [391], [395], [396], [397] [2019-09-10 07:36:46,603 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:36:46,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:36:46,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:36:46,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:36:46,756 INFO L272 AbstractInterpreter]: Visited 102 different actions 399 times. Merged at 41 different actions 265 times. Widened at 9 different actions 25 times. Performed 1514 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 119 variables. [2019-09-10 07:36:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:36:46,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:36:46,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:36:46,757 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:36:47,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:36:47,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:36:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:36:47,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:36:47,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:36:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:47,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:36:48,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:48,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:36:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:36:48,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:36:48,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 42 [2019-09-10 07:36:48,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:36:48,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:36:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:36:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1597, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:36:48,437 INFO L87 Difference]: Start difference. First operand 40872 states and 48925 transitions. Second operand 32 states. [2019-09-10 07:36:51,977 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-09-10 07:36:52,194 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 07:36:52,560 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:36:52,821 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:36:53,630 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:36:53,785 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-09-10 07:36:54,119 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 07:36:54,657 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 07:36:55,004 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:36:55,791 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 07:36:56,069 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:36:56,618 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:36:56,832 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:36:57,096 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 07:36:57,752 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:36:58,216 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:36:58,519 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:36:58,807 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 07:36:59,349 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:37:00,100 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:37:00,385 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 07:37:00,860 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:37:01,242 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 07:37:01,491 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:37:01,876 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:37:02,102 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:37:02,443 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:37:02,677 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:37:02,928 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 07:37:03,425 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:37:03,618 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:37:03,887 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:37:04,199 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:37:04,646 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:37:04,838 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 07:37:05,053 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:37:05,323 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:37:05,713 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:37:05,962 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 07:37:06,347 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-09-10 07:37:06,537 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-09-10 07:37:06,801 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-09-10 07:37:07,036 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:37:07,360 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2019-09-10 07:37:07,600 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 07:37:07,868 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-10 07:37:08,318 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:37:08,500 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 07:37:08,708 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 07:37:08,962 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:37:09,716 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:37:10,298 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:37:11,252 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:37:11,944 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 07:37:12,628 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 07:37:13,250 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:37:13,574 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 07:37:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:37:14,280 INFO L93 Difference]: Finished difference Result 74069 states and 88623 transitions. [2019-09-10 07:37:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 07:37:14,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 109 [2019-09-10 07:37:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:37:14,348 INFO L225 Difference]: With dead ends: 74069 [2019-09-10 07:37:14,349 INFO L226 Difference]: Without dead ends: 74069 [2019-09-10 07:37:14,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10450 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=4938, Invalid=28734, Unknown=0, NotChecked=0, Total=33672 [2019-09-10 07:37:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74069 states. [2019-09-10 07:37:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74069 to 43329. [2019-09-10 07:37:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43329 states. [2019-09-10 07:37:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43329 states to 43329 states and 51628 transitions. [2019-09-10 07:37:14,752 INFO L78 Accepts]: Start accepts. Automaton has 43329 states and 51628 transitions. Word has length 109 [2019-09-10 07:37:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:37:14,753 INFO L475 AbstractCegarLoop]: Abstraction has 43329 states and 51628 transitions. [2019-09-10 07:37:14,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:37:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43329 states and 51628 transitions. [2019-09-10 07:37:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:37:14,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:37:14,755 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:37:14,755 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:37:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 957159199, now seen corresponding path program 1 times [2019-09-10 07:37:14,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:37:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:14,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:14,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:37:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:15,019 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-09-10 07:37:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:15,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:15,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:37:15,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:37:15,281 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [328], [333], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:37:15,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:37:15,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:37:15,296 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:37:15,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:37:15,518 INFO L272 AbstractInterpreter]: Visited 102 different actions 470 times. Merged at 41 different actions 326 times. Widened at 11 different actions 40 times. Performed 1729 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1729 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 11 different actions. Largest state had 119 variables. [2019-09-10 07:37:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:15,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:37:15,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:15,518 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) [2019-09-10 07:37:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:15,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:37:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:15,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:37:15,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:37:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:15,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:16,086 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:37:16,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:16,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:37:16,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 34 [2019-09-10 07:37:16,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:37:16,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:37:16,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:37:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:37:16,474 INFO L87 Difference]: Start difference. First operand 43329 states and 51628 transitions. Second operand 26 states. [2019-09-10 07:37:17,862 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:37:18,024 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-09-10 07:37:18,276 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-09-10 07:37:19,458 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 07:37:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:37:19,504 INFO L93 Difference]: Finished difference Result 49907 states and 59184 transitions. [2019-09-10 07:37:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:37:19,505 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2019-09-10 07:37:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:37:19,547 INFO L225 Difference]: With dead ends: 49907 [2019-09-10 07:37:19,548 INFO L226 Difference]: Without dead ends: 49907 [2019-09-10 07:37:19,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=578, Invalid=2502, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:37:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49907 states. [2019-09-10 07:37:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49907 to 41966. [2019-09-10 07:37:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41966 states. [2019-09-10 07:37:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41966 states to 41966 states and 49837 transitions. [2019-09-10 07:37:19,874 INFO L78 Accepts]: Start accepts. Automaton has 41966 states and 49837 transitions. Word has length 109 [2019-09-10 07:37:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:37:19,875 INFO L475 AbstractCegarLoop]: Abstraction has 41966 states and 49837 transitions. [2019-09-10 07:37:19,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:37:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 41966 states and 49837 transitions. [2019-09-10 07:37:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:37:19,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:37:19,876 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:37:19,876 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:37:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -156350116, now seen corresponding path program 1 times [2019-09-10 07:37:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:37:19,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:19,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:37:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:19,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:37:19,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:37:19,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:37:19,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:37:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:37:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:37:19,922 INFO L87 Difference]: Start difference. First operand 41966 states and 49837 transitions. Second operand 3 states. [2019-09-10 07:37:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:37:19,953 INFO L93 Difference]: Finished difference Result 7899 states and 9108 transitions. [2019-09-10 07:37:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:37:19,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:37:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:37:19,961 INFO L225 Difference]: With dead ends: 7899 [2019-09-10 07:37:19,961 INFO L226 Difference]: Without dead ends: 7899 [2019-09-10 07:37:19,962 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:37:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2019-09-10 07:37:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7555. [2019-09-10 07:37:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7555 states. [2019-09-10 07:37:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 8728 transitions. [2019-09-10 07:37:20,036 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 8728 transitions. Word has length 109 [2019-09-10 07:37:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:37:20,037 INFO L475 AbstractCegarLoop]: Abstraction has 7555 states and 8728 transitions. [2019-09-10 07:37:20,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:37:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 8728 transitions. [2019-09-10 07:37:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:37:20,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:37:20,039 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:37:20,039 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:37:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1965136409, now seen corresponding path program 1 times [2019-09-10 07:37:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:37:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:20,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:20,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:37:20,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:37:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:20,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:20,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:37:20,856 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:37:20,857 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [304], [307], [309], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:37:20,858 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:37:20,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:37:20,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:37:21,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:37:21,037 INFO L272 AbstractInterpreter]: Visited 100 different actions 380 times. Merged at 40 different actions 248 times. Widened at 9 different actions 23 times. Performed 1471 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1471 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 9 different actions. Largest state had 119 variables. [2019-09-10 07:37:21,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:37:21,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:37:21,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:37:21,038 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:37:21,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:37:21,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:37:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:37:21,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 07:37:21,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:37:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:22,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:24,758 WARN L188 SmtUtils]: Spent 830.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-10 07:37:24,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:25,354 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-10 07:37:25,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:25,915 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-09-10 07:37:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:26,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:37:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:27,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:27,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:37:29,413 WARN L188 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 07:37:33,197 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-10 07:37:33,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:37:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:37:33,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:37:33,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 21] total 61 [2019-09-10 07:37:33,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:37:33,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:37:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:37:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3408, Unknown=3, NotChecked=0, Total=3660 [2019-09-10 07:37:33,477 INFO L87 Difference]: Start difference. First operand 7555 states and 8728 transitions. Second operand 43 states. [2019-09-10 07:37:35,149 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 07:37:36,398 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:37:36,622 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:37:37,919 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:37:39,592 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:37:41,551 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:37:43,439 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:37:45,179 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-09-10 07:37:45,821 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 07:37:46,367 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:37:46,676 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:37:47,933 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 07:37:48,232 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:37:49,133 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:37:49,465 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:37:50,000 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-09-10 07:37:54,164 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:37:57,636 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:37:59,546 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-10 07:38:00,730 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:38:01,507 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:38:01,952 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:38:02,899 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:03,463 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:38:03,702 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:38:04,080 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:38:05,592 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:38:07,842 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:38:08,089 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:38:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:08,092 INFO L93 Difference]: Finished difference Result 9446 states and 10907 transitions. [2019-09-10 07:38:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 07:38:08,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2019-09-10 07:38:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:08,100 INFO L225 Difference]: With dead ends: 9446 [2019-09-10 07:38:08,101 INFO L226 Difference]: Without dead ends: 9406 [2019-09-10 07:38:08,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 163 SyntacticMatches, 18 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=1540, Invalid=12495, Unknown=7, NotChecked=0, Total=14042 [2019-09-10 07:38:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2019-09-10 07:38:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 7546. [2019-09-10 07:38:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7546 states. [2019-09-10 07:38:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 8715 transitions. [2019-09-10 07:38:08,160 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 8715 transitions. Word has length 109 [2019-09-10 07:38:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:08,160 INFO L475 AbstractCegarLoop]: Abstraction has 7546 states and 8715 transitions. [2019-09-10 07:38:08,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:38:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 8715 transitions. [2019-09-10 07:38:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:38:08,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:08,162 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:08,162 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1342107213, now seen corresponding path program 1 times [2019-09-10 07:38:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:08,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:09,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:09,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:09,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:38:09,094 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [297], [301], [304], [307], [309], [328], [333], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:38:09,096 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:09,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:09,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:09,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:09,297 INFO L272 AbstractInterpreter]: Visited 103 different actions 462 times. Merged at 42 different actions 318 times. Widened at 12 different actions 42 times. Performed 1729 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1729 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 12 different actions. Largest state had 119 variables. [2019-09-10 07:38:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:09,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:09,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:09,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:09,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:09,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:09,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 07:38:09,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:10,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:10,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 16] total 49 [2019-09-10 07:38:11,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:11,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:38:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:38:11,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2125, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:38:11,160 INFO L87 Difference]: Start difference. First operand 7546 states and 8715 transitions. Second operand 39 states. [2019-09-10 07:38:13,986 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 07:38:14,397 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:38:14,799 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-10 07:38:15,033 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:38:15,191 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:38:15,815 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 07:38:16,171 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:38:16,610 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:38:17,069 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:38:17,487 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:38:17,805 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:38:18,536 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 07:38:18,971 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:38:19,344 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:38:19,722 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 07:38:19,893 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:38:20,211 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:38:23,312 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:38:23,697 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:38:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:24,274 INFO L93 Difference]: Finished difference Result 16106 states and 18733 transitions. [2019-09-10 07:38:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 07:38:24,274 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2019-09-10 07:38:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:24,289 INFO L225 Difference]: With dead ends: 16106 [2019-09-10 07:38:24,290 INFO L226 Difference]: Without dead ends: 16106 [2019-09-10 07:38:24,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4454 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2431, Invalid=13825, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 07:38:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16106 states. [2019-09-10 07:38:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16106 to 7546. [2019-09-10 07:38:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7546 states. [2019-09-10 07:38:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 8713 transitions. [2019-09-10 07:38:24,377 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 8713 transitions. Word has length 110 [2019-09-10 07:38:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:24,377 INFO L475 AbstractCegarLoop]: Abstraction has 7546 states and 8713 transitions. [2019-09-10 07:38:24,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:38:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 8713 transitions. [2019-09-10 07:38:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:38:24,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:24,378 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:24,379 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1883106715, now seen corresponding path program 1 times [2019-09-10 07:38:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:24,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:25,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:25,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:25,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:38:25,666 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [130], [132], [135], [138], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [297], [301], [304], [307], [309], [328], [333], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:38:25,668 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:25,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:25,676 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:25,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:25,860 INFO L272 AbstractInterpreter]: Visited 102 different actions 554 times. Merged at 41 different actions 401 times. Widened at 10 different actions 45 times. Performed 2085 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2085 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 16 different actions. Largest state had 119 variables. [2019-09-10 07:38:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:25,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:25,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:25,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:38:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:25,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:25,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 07:38:25,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:26,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:28,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:29,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:29,926 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 07:38:30,462 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:38:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 66 [2019-09-10 07:38:31,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:31,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 07:38:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 07:38:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=4009, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 07:38:31,012 INFO L87 Difference]: Start difference. First operand 7546 states and 8713 transitions. Second operand 48 states. [2019-09-10 07:38:31,384 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-10 07:38:31,693 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 07:38:33,435 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-09-10 07:38:33,774 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-09-10 07:38:34,682 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:38:35,607 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:38:36,569 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-09-10 07:38:37,219 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-09-10 07:38:37,728 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 07:38:37,917 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:38:38,124 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:38:38,359 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:38:38,895 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 07:38:39,328 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:38:39,866 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 07:38:40,101 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:38:40,633 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:40,896 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:38:41,146 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:38:41,640 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:38:42,335 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:38:42,804 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:38:43,078 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:43,610 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:38:44,054 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 07:38:44,572 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:38:44,940 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 07:38:45,710 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:38:46,093 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:38:49,962 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:38:51,312 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:38:51,853 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:38:52,220 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:38:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:53,678 INFO L93 Difference]: Finished difference Result 16208 states and 18627 transitions. [2019-09-10 07:38:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 07:38:53,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-09-10 07:38:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:53,691 INFO L225 Difference]: With dead ends: 16208 [2019-09-10 07:38:53,691 INFO L226 Difference]: Without dead ends: 16208 [2019-09-10 07:38:53,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5557 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=1828, Invalid=18478, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 07:38:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16208 states. [2019-09-10 07:38:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16208 to 7540. [2019-09-10 07:38:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7540 states. [2019-09-10 07:38:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7540 states to 7540 states and 8704 transitions. [2019-09-10 07:38:53,777 INFO L78 Accepts]: Start accepts. Automaton has 7540 states and 8704 transitions. Word has length 111 [2019-09-10 07:38:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:53,777 INFO L475 AbstractCegarLoop]: Abstraction has 7540 states and 8704 transitions. [2019-09-10 07:38:53,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 07:38:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7540 states and 8704 transitions. [2019-09-10 07:38:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:38:53,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:53,779 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:53,779 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1767265353, now seen corresponding path program 1 times [2019-09-10 07:38:53,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:53,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:54,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:54,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:54,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:38:54,572 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [66], [70], [73], [76], [78], [82], [85], [88], [90], [93], [97], [100], [103], [107], [110], [113], [116], [121], [124], [127], [132], [135], [138], [141], [143], [146], [150], [153], [156], [160], [162], [165], [168], [171], [176], [178], [181], [184], [189], [191], [194], [197], [200], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [238], [251], [254], [257], [259], [267], [272], [276], [279], [282], [284], [292], [295], [301], [304], [307], [309], [338], [343], [348], [353], [390], [391], [395], [396], [397] [2019-09-10 07:38:54,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:54,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:54,584 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:54,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:54,717 INFO L272 AbstractInterpreter]: Visited 102 different actions 464 times. Merged at 41 different actions 324 times. Widened at 12 different actions 38 times. Performed 1704 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1704 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 13 different actions. Largest state had 119 variables. [2019-09-10 07:38:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:54,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:54,717 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:54,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:54,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 07:38:54,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:55,516 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-09-10 07:38:55,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:56,368 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 07:38:56,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:57,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:57,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:58,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:58,746 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2019-09-10 07:38:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:59,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:59,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 20] total 57 [2019-09-10 07:38:59,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:59,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:38:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:38:59,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2957, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:38:59,614 INFO L87 Difference]: Start difference. First operand 7540 states and 8704 transitions. Second operand 43 states.