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/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:59:23,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:23,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:23,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:23,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:23,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:23,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:23,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:23,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:23,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:23,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:23,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:23,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:23,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:23,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:23,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:23,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:23,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:23,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:23,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:23,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:23,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:23,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:23,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:23,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:23,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:23,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:23,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:23,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:23,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:23,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:23,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:23,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:23,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:23,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:23,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:23,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:23,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:23,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:23,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:23,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:23,660 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-10-03 02:59:23,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:23,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:23,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:23,686 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:23,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:23,687 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:23,687 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:23,687 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:23,687 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:23,687 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:23,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:23,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:23,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:23,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:23,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:23,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:23,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:23,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:23,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:23,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:23,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:23,693 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:23,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:23,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:23,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:23,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:23,694 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:23,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:23,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:23,695 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:23,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:23,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:23,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:23,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:23,752 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:23,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-03 02:59:23,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2d02b46/718a9e551c58495d851ca313b71135ae/FLAG9681791ac [2019-10-03 02:59:24,360 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:24,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-03 02:59:24,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2d02b46/718a9e551c58495d851ca313b71135ae/FLAG9681791ac [2019-10-03 02:59:24,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2d02b46/718a9e551c58495d851ca313b71135ae [2019-10-03 02:59:24,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:24,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:24,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:24,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:24,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:24,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:24" (1/1) ... [2019-10-03 02:59:24,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348b11b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:24, skipping insertion in model container [2019-10-03 02:59:24,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:24" (1/1) ... [2019-10-03 02:59:24,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:24,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:25,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:25,195 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:25,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:25,290 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:25,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25 WrapperNode [2019-10-03 02:59:25,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:25,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:25,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:25,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:25,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (1/1) ... [2019-10-03 02:59:25,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:25,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:25,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:25,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:25,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (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-10-03 02:59:25,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:25,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:25,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:26,456 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:26,457 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 02:59:26,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:26 BoogieIcfgContainer [2019-10-03 02:59:26,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:26,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:26,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:26,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:26,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:24" (1/3) ... [2019-10-03 02:59:26,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac60da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:26, skipping insertion in model container [2019-10-03 02:59:26,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:25" (2/3) ... [2019-10-03 02:59:26,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac60da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:26, skipping insertion in model container [2019-10-03 02:59:26,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:26" (3/3) ... [2019-10-03 02:59:26,468 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-10-03 02:59:26,477 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:26,485 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:26,504 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:26,534 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:26,534 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:26,534 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:26,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:26,535 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:26,535 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:26,535 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:26,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-10-03 02:59:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:59:26,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:26,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:26,568 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1282888521, now seen corresponding path program 1 times [2019-10-03 02:59:26,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:26,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:26,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:26,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:26,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:26,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:26,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:26,751 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-10-03 02:59:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:26,779 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2019-10-03 02:59:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:26,781 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-03 02:59:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:26,792 INFO L225 Difference]: With dead ends: 114 [2019-10-03 02:59:26,793 INFO L226 Difference]: Without dead ends: 104 [2019-10-03 02:59:26,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-03 02:59:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-03 02:59:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-03 02:59:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-10-03 02:59:26,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 12 [2019-10-03 02:59:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:26,849 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-10-03 02:59:26,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-10-03 02:59:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:59:26,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:26,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:26,851 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1647326006, now seen corresponding path program 1 times [2019-10-03 02:59:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:26,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:26,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:26,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:26,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:26,961 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-10-03 02:59:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:27,048 INFO L93 Difference]: Finished difference Result 107 states and 172 transitions. [2019-10-03 02:59:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:27,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:59:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:27,051 INFO L225 Difference]: With dead ends: 107 [2019-10-03 02:59:27,051 INFO L226 Difference]: Without dead ends: 107 [2019-10-03 02:59:27,052 INFO L640 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-10-03 02:59:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-03 02:59:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-03 02:59:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-03 02:59:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2019-10-03 02:59:27,065 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 13 [2019-10-03 02:59:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:27,065 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2019-10-03 02:59:27,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-10-03 02:59:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:59:27,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:27,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:27,068 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -585097013, now seen corresponding path program 1 times [2019-10-03 02:59:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:27,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:33,690 WARN L191 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2019-10-03 02:59:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:33,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:59:33,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:33,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:59:33,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:59:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:33,696 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2019-10-03 02:59:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:34,355 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2019-10-03 02:59:34,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:34,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-03 02:59:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:34,359 INFO L225 Difference]: With dead ends: 207 [2019-10-03 02:59:34,359 INFO L226 Difference]: Without dead ends: 190 [2019-10-03 02:59:34,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-03 02:59:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-10-03 02:59:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-03 02:59:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2019-10-03 02:59:34,384 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 18 [2019-10-03 02:59:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:34,385 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2019-10-03 02:59:34,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:59:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2019-10-03 02:59:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:59:34,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:34,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:34,390 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1793109076, now seen corresponding path program 1 times [2019-10-03 02:59:34,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:34,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:34,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:34,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:34,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:34,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:34,461 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2019-10-03 02:59:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:34,498 INFO L93 Difference]: Finished difference Result 128 states and 199 transitions. [2019-10-03 02:59:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:34,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:59:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:34,500 INFO L225 Difference]: With dead ends: 128 [2019-10-03 02:59:34,500 INFO L226 Difference]: Without dead ends: 128 [2019-10-03 02:59:34,503 INFO L640 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-10-03 02:59:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-03 02:59:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-10-03 02:59:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-03 02:59:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-10-03 02:59:34,526 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 19 [2019-10-03 02:59:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:34,527 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-10-03 02:59:34,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-10-03 02:59:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:59:34,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:34,532 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:34,532 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1977269043, now seen corresponding path program 1 times [2019-10-03 02:59:34,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:34,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:34,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:34,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:34,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:34,603 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2019-10-03 02:59:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:34,647 INFO L93 Difference]: Finished difference Result 111 states and 168 transitions. [2019-10-03 02:59:34,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:34,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:59:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:34,649 INFO L225 Difference]: With dead ends: 111 [2019-10-03 02:59:34,649 INFO L226 Difference]: Without dead ends: 111 [2019-10-03 02:59:34,650 INFO L640 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-10-03 02:59:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-03 02:59:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-10-03 02:59:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-03 02:59:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2019-10-03 02:59:34,664 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 24 [2019-10-03 02:59:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:34,665 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2019-10-03 02:59:34,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2019-10-03 02:59:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:59:34,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:34,669 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:34,669 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 330981550, now seen corresponding path program 1 times [2019-10-03 02:59:34,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:34,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:36,808 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~P1~0 2)) (.cse21 (div c_main_~this_expect~0 2))) (let ((.cse17 (* (- 2) .cse21)) (.cse5 (* 2 .cse21)) (.cse19 (* (- 2) .cse20))) (let ((.cse12 (* 4294967296 (div (+ c_main_~P1~0 .cse19) 4294967296))) (.cse7 (* 4 .cse20)) (.cse15 (= .cse5 c_main_~this_expect~0)) (.cse16 (* 4294967296 (div c_main_~this_expect~0 4294967296))) (.cse14 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17) 4294967296))) (.cse4 (* 2 c_main_~P1~0)) (.cse18 (= c_main_~P1~0 (* 2 .cse20)))) (let ((.cse6 (* 4294967296 (div (+ c_main_~P1~0 .cse19 (- 2)) 4294967296))) (.cse0 (< c_main_~P1~0 0)) (.cse10 (not .cse18)) (.cse8 (+ .cse14 .cse4 .cse5)) (.cse11 (or .cse18 (<= 0 c_main_~P1~0))) (.cse1 (< c_main_~this_expect~0 .cse16)) (.cse3 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17 (- 2)) 4294967296))) (.cse2 (not .cse15)) (.cse13 (+ c_main_~this_expect~0 .cse12 .cse7)) (.cse9 (or .cse15 (<= .cse16 c_main_~this_expect~0)))) (or (and .cse0 (or (and .cse1 .cse2 (<= (+ .cse3 .cse4 .cse5 1) (+ c_main_~this_expect~0 .cse6 .cse7))) (and (<= .cse8 (+ c_main_~this_expect~0 .cse6 .cse7 3)) .cse9)) .cse10) (and (or (and .cse1 .cse2 (<= (+ c_main_~this_expect~0 .cse6 .cse7 1) (+ .cse3 .cse4 .cse5))) (and (<= (+ c_main_~this_expect~0 .cse6 .cse7 5) .cse8) .cse9)) .cse0 .cse10) (and .cse11 (or (and (<= (+ c_main_~this_expect~0 .cse12 .cse7 1) .cse8) .cse9) (and .cse1 .cse2 (<= .cse13 (+ .cse3 .cse4 .cse5 3))))) (and .cse11 (or (and .cse1 (<= (+ .cse3 .cse4 .cse5 5) .cse13) .cse2) (and (<= (+ .cse14 .cse4 .cse5 1) .cse13) .cse9)))))))) is different from false [2019-10-03 02:59:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-03 02:59:36,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:36,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:36,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-10-03 02:59:36,832 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [232], [235], [238], [519], [525], [526], [527], [528] [2019-10-03 02:59:36,879 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:36,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:36,991 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:38,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:38,765 INFO L272 AbstractInterpreter]: Visited 24 different actions 80 times. Merged at 16 different actions 49 times. Never widened. Performed 426 root evaluator evaluations with a maximum evaluation depth of 16. Performed 426 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 6 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-03 02:59:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:38,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:38,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:38,773 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-10-03 02:59:38,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:38,805 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-10-03 02:59:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:38,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 02:59:38,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:38,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-10-03 02:59:38,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:38,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2019-10-03 02:59:38,984 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 7 states. [2019-10-03 02:59:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:39,484 INFO L93 Difference]: Finished difference Result 352 states and 520 transitions. [2019-10-03 02:59:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:59:39,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-03 02:59:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:39,488 INFO L225 Difference]: With dead ends: 352 [2019-10-03 02:59:39,488 INFO L226 Difference]: Without dead ends: 314 [2019-10-03 02:59:39,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2019-10-03 02:59:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-03 02:59:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2019-10-03 02:59:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-03 02:59:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2019-10-03 02:59:39,502 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 26 [2019-10-03 02:59:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:39,502 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2019-10-03 02:59:39,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2019-10-03 02:59:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:59:39,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:39,504 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:39,504 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -353360053, now seen corresponding path program 1 times [2019-10-03 02:59:39,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:39,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:39,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:39,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:39,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:39,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:39,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:39,544 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states. [2019-10-03 02:59:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:39,573 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2019-10-03 02:59:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:39,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:59:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:39,577 INFO L225 Difference]: With dead ends: 301 [2019-10-03 02:59:39,577 INFO L226 Difference]: Without dead ends: 301 [2019-10-03 02:59:39,577 INFO L640 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-10-03 02:59:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-03 02:59:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2019-10-03 02:59:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-03 02:59:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2019-10-03 02:59:39,589 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 28 [2019-10-03 02:59:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:39,589 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2019-10-03 02:59:39,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2019-10-03 02:59:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:59:39,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:39,591 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:39,591 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 893006896, now seen corresponding path program 1 times [2019-10-03 02:59:39,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:39,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:39,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:39,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:39,898 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2019-10-03 02:59:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:39,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:39,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:39,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-10-03 02:59:39,905 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [260], [275], [290], [293], [296], [299], [519], [525], [526], [527], [528] [2019-10-03 02:59:39,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:39,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:39,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:40,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:40,884 INFO L272 AbstractInterpreter]: Visited 28 different actions 74 times. Merged at 20 different actions 41 times. Never widened. Performed 373 root evaluator evaluations with a maximum evaluation depth of 16. Performed 373 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 3 different actions. Largest state had 43 variables. [2019-10-03 02:59:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:40,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:40,886 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-10-03 02:59:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:40,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:40,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-03 02:59:40,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:59:41,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:59:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:59:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-03 02:59:41,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:41,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:41,141 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 3 states. [2019-10-03 02:59:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:41,159 INFO L93 Difference]: Finished difference Result 299 states and 454 transitions. [2019-10-03 02:59:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:41,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:59:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:41,164 INFO L225 Difference]: With dead ends: 299 [2019-10-03 02:59:41,164 INFO L226 Difference]: Without dead ends: 295 [2019-10-03 02:59:41,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-03 02:59:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-03 02:59:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-03 02:59:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2019-10-03 02:59:41,177 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 30 [2019-10-03 02:59:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:41,179 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2019-10-03 02:59:41,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2019-10-03 02:59:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:59:41,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:41,190 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:41,191 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1859369291, now seen corresponding path program 1 times [2019-10-03 02:59:41,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 02:59:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:41,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:41,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:41,257 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states. [2019-10-03 02:59:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:41,304 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2019-10-03 02:59:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:41,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:59:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:41,309 INFO L225 Difference]: With dead ends: 247 [2019-10-03 02:59:41,309 INFO L226 Difference]: Without dead ends: 247 [2019-10-03 02:59:41,310 INFO L640 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-10-03 02:59:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-03 02:59:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-10-03 02:59:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-03 02:59:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2019-10-03 02:59:41,320 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 36 [2019-10-03 02:59:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:41,320 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2019-10-03 02:59:41,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2019-10-03 02:59:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:59:41,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:41,321 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-03 02:59:41,322 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash -540657092, now seen corresponding path program 1 times [2019-10-03 02:59:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:41,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 02:59:41,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:41,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:41,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:41,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:41,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:41,395 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2019-10-03 02:59:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:41,432 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2019-10-03 02:59:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:41,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-03 02:59:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:41,435 INFO L225 Difference]: With dead ends: 229 [2019-10-03 02:59:41,435 INFO L226 Difference]: Without dead ends: 229 [2019-10-03 02:59:41,435 INFO L640 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-10-03 02:59:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-03 02:59:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-03 02:59:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-03 02:59:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2019-10-03 02:59:41,442 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 40 [2019-10-03 02:59:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:41,443 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2019-10-03 02:59:41,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2019-10-03 02:59:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:59:41,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:41,444 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-10-03 02:59:41,444 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash -850178048, now seen corresponding path program 1 times [2019-10-03 02:59:41,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:41,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:41,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-03 02:59:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:41,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:41,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:41,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:41,498 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2019-10-03 02:59:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:41,534 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2019-10-03 02:59:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:41,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-03 02:59:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:41,536 INFO L225 Difference]: With dead ends: 147 [2019-10-03 02:59:41,536 INFO L226 Difference]: Without dead ends: 147 [2019-10-03 02:59:41,537 INFO L640 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-10-03 02:59:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-03 02:59:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-03 02:59:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-03 02:59:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2019-10-03 02:59:41,541 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 49 [2019-10-03 02:59:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:41,542 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2019-10-03 02:59:41,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2019-10-03 02:59:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:59:41,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:41,543 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-10-03 02:59:41,543 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1539512454, now seen corresponding path program 1 times [2019-10-03 02:59:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:41,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:43,769 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-10-03 02:59:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 02:59:43,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:43,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:43,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2019-10-03 02:59:43,781 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [519], [525], [526], [527], [528] [2019-10-03 02:59:43,784 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:43,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:43,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:57,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:57,732 INFO L272 AbstractInterpreter]: Visited 39 different actions 240 times. Merged at 31 different actions 172 times. Widened at 2 different actions 5 times. Performed 1302 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1302 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2019-10-03 02:59:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:57,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:57,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:57,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:57,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:57,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:57,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 02:59:57,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:57,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:58,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-10-03 02:59:58,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:58,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:59:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:59:58,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:59:58,073 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 10 states. [2019-10-03 02:59:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:58,194 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2019-10-03 02:59:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:59:58,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-03 02:59:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:58,196 INFO L225 Difference]: With dead ends: 169 [2019-10-03 02:59:58,196 INFO L226 Difference]: Without dead ends: 164 [2019-10-03 02:59:58,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:59:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-03 02:59:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-03 02:59:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-03 02:59:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2019-10-03 02:59:58,204 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 50 [2019-10-03 02:59:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:58,207 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2019-10-03 02:59:58,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:59:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2019-10-03 02:59:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:59:58,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:58,208 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2019-10-03 02:59:58,209 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash -520384290, now seen corresponding path program 1 times [2019-10-03 02:59:58,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:58,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:58,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:10,832 WARN L191 SmtUtils]: Spent 12.20 s on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-10-03 03:00:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:10,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:10,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:10,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2019-10-03 03:00:10,845 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [47], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-10-03 03:00:10,850 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:10,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:10,859 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:26,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:26,512 INFO L272 AbstractInterpreter]: Visited 44 different actions 318 times. Merged at 33 different actions 231 times. Widened at 4 different actions 9 times. Performed 1573 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1573 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 41 fixpoints after 10 different actions. Largest state had 50 variables. [2019-10-03 03:00:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:26,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:26,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:26,513 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-10-03 03:00:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:26,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:26,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-03 03:00:26,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:26,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:00:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:26,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:27,520 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2019-10-03 03:00:27,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:00:27,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2019-10-03 03:00:27,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:27,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:00:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:00:27,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:00:27,569 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand 11 states. [2019-10-03 03:00:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:27,929 INFO L93 Difference]: Finished difference Result 179 states and 248 transitions. [2019-10-03 03:00:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:00:27,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-03 03:00:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:27,930 INFO L225 Difference]: With dead ends: 179 [2019-10-03 03:00:27,931 INFO L226 Difference]: Without dead ends: 179 [2019-10-03 03:00:27,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:00:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-03 03:00:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-10-03 03:00:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-03 03:00:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-10-03 03:00:27,936 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 60 [2019-10-03 03:00:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:27,936 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-10-03 03:00:27,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:00:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-10-03 03:00:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 03:00:27,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:27,938 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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] [2019-10-03 03:00:27,938 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash -910800964, now seen corresponding path program 1 times [2019-10-03 03:00:27,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:27,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:28,355 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 28 [2019-10-03 03:00:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:28,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:28,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:28,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2019-10-03 03:00:28,376 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [253], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-10-03 03:00:28,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:28,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:28,390 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:38,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:38,896 INFO L272 AbstractInterpreter]: Visited 44 different actions 461 times. Merged at 36 different actions 358 times. Widened at 5 different actions 15 times. Performed 2134 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 59 fixpoints after 14 different actions. Largest state had 50 variables. [2019-10-03 03:00:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:38,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:38,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:38,896 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-10-03 03:00:38,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:38,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:38,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-03 03:00:38,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:39,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 03:00:39,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 13 [2019-10-03 03:00:39,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:39,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:00:39,210 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 9 states. [2019-10-03 03:00:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:39,335 INFO L93 Difference]: Finished difference Result 196 states and 272 transitions. [2019-10-03 03:00:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:00:39,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-10-03 03:00:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:39,338 INFO L225 Difference]: With dead ends: 196 [2019-10-03 03:00:39,338 INFO L226 Difference]: Without dead ends: 196 [2019-10-03 03:00:39,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:00:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-03 03:00:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-03 03:00:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-03 03:00:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 272 transitions. [2019-10-03 03:00:39,347 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 272 transitions. Word has length 69 [2019-10-03 03:00:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:39,348 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 272 transitions. [2019-10-03 03:00:39,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 272 transitions. [2019-10-03 03:00:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 03:00:39,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:39,350 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:39,350 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1119936115, now seen corresponding path program 1 times [2019-10-03 03:00:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:39,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:39,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:41,957 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 74 DAG size of output: 19 [2019-10-03 03:00:44,358 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 199 DAG size of output: 33 [2019-10-03 03:00:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:44,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:44,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:44,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-10-03 03:00:44,380 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-10-03 03:00:44,385 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:44,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:44,392 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:53,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:53,337 INFO L272 AbstractInterpreter]: Visited 44 different actions 299 times. Merged at 36 different actions 217 times. Widened at 4 different actions 7 times. Performed 1285 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1285 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 38 fixpoints after 12 different actions. Largest state had 50 variables. [2019-10-03 03:00:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:53,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:53,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:53,338 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:00:53,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:53,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:53,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-03 03:00:53,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:53,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:00:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:53,996 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 26 [2019-10-03 03:00:54,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:54,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:54,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:54,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:00:54,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 18 [2019-10-03 03:00:54,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:54,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:00:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:00:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:00:54,552 INFO L87 Difference]: Start difference. First operand 196 states and 272 transitions. Second operand 12 states. [2019-10-03 03:00:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:54,900 INFO L93 Difference]: Finished difference Result 215 states and 298 transitions. [2019-10-03 03:00:54,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:00:54,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-10-03 03:00:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:54,903 INFO L225 Difference]: With dead ends: 215 [2019-10-03 03:00:54,903 INFO L226 Difference]: Without dead ends: 215 [2019-10-03 03:00:54,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:00:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-03 03:00:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-10-03 03:00:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-03 03:00:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2019-10-03 03:00:54,918 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 81 [2019-10-03 03:00:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:54,918 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2019-10-03 03:00:54,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:00:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2019-10-03 03:00:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:00:54,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:54,920 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:54,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1236873263, now seen corresponding path program 1 times [2019-10-03 03:00:54,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 106 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 03:00:55,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:55,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:55,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-10-03 03:00:55,435 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [505], [507], [519], [525], [526], [527], [528] [2019-10-03 03:00:55,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:55,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:55,449 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:03,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:03,680 INFO L272 AbstractInterpreter]: Visited 44 different actions 298 times. Merged at 36 different actions 217 times. Widened at 4 different actions 7 times. Performed 1284 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 37 fixpoints after 11 different actions. Largest state had 50 variables. [2019-10-03 03:01:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:03,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:03,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:03,681 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-10-03 03:01:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:03,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:03,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-03 03:01:03,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:03,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:04,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:04,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:04,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:04,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 82 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-03 03:01:04,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:04,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 20 [2019-10-03 03:01:04,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:04,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:01:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:01:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:01:04,397 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand 15 states. [2019-10-03 03:01:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:04,654 INFO L93 Difference]: Finished difference Result 234 states and 322 transitions. [2019-10-03 03:01:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:01:04,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-10-03 03:01:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:04,655 INFO L225 Difference]: With dead ends: 234 [2019-10-03 03:01:04,655 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 03:01:04,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:01:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 03:01:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 03:01:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 03:01:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 03:01:04,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2019-10-03 03:01:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:04,657 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 03:01:04,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:01:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 03:01:04,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 03:01:04,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:01:04 BoogieIcfgContainer [2019-10-03 03:01:04,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:01:04,674 INFO L168 Benchmark]: Toolchain (without parser) took 99990.20 ms. Allocated memory was 133.2 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 88.2 MB in the beginning and 418.1 MB in the end (delta: -329.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,675 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.31 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.9 MB in the beginning and 171.1 MB in the end (delta: -83.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,679 INFO L168 Benchmark]: Boogie Preprocessor took 97.90 ms. Allocated memory is still 201.3 MB. Free memory was 171.1 MB in the beginning and 167.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,684 INFO L168 Benchmark]: RCFGBuilder took 1068.90 ms. Allocated memory is still 201.3 MB. Free memory was 167.8 MB in the beginning and 113.8 MB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,685 INFO L168 Benchmark]: TraceAbstraction took 98206.51 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 113.1 MB in the beginning and 418.1 MB in the end (delta: -304.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 03:01:04,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 612.31 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.9 MB in the beginning and 171.1 MB in the end (delta: -83.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.90 ms. Allocated memory is still 201.3 MB. Free memory was 171.1 MB in the beginning and 167.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1068.90 ms. Allocated memory is still 201.3 MB. Free memory was 167.8 MB in the beginning and 113.8 MB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98206.51 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 113.1 MB in the beginning and 418.1 MB in the end (delta: -304.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 98.1s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2554 SDtfs, 2006 SDslu, 7030 SDs, 0 SdLazy, 1001 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 799 SyntacticMatches, 12 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 60.2s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 64 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1445 ConstructedInterpolants, 122 QuantifiedInterpolants, 1447891 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2843 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 352/1311 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...