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/float-benchs/zonotope_2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:39:47,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:39:47,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:39:47,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:39:47,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:39:47,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:39:47,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:39:47,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:39:47,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:39:47,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:39:47,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:39:47,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:39:47,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:39:47,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:39:47,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:39:47,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:39:47,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:39:47,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:39:47,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:39:47,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:39:47,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:39:47,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:39:47,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:39:47,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:39:47,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:39:47,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:39:47,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:39:47,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:39:47,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:39:47,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:39:47,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:39:47,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:39:47,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:39:47,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:39:47,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:39:47,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:39:47,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:39:47,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:39:47,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:39:47,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:39:47,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:39:47,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:39:47,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:39:47,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:39:47,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:39:47,132 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:39:47,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:39:47,133 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:39:47,133 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:39:47,133 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:39:47,133 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:39:47,133 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:39:47,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:39:47,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:39:47,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:39:47,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:39:47,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:39:47,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:39:47,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:39:47,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:39:47,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:39:47,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:39:47,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:39:47,136 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:39:47,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:39:47,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:39:47,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:39:47,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:39:47,138 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:39:47,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:39:47,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:39:47,138 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:39:47,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:39:47,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:39:47,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:39:47,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:39:47,211 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:39:47,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_2.c [2019-09-10 01:39:47,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b6ad35d/2d9b050a332343239eddb1bcb125804b/FLAGdf8106158 [2019-09-10 01:39:47,735 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:39:47,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_2.c [2019-09-10 01:39:47,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b6ad35d/2d9b050a332343239eddb1bcb125804b/FLAGdf8106158 [2019-09-10 01:39:48,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b6ad35d/2d9b050a332343239eddb1bcb125804b [2019-09-10 01:39:48,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:39:48,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:39:48,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:48,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:39:48,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:39:48,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd7f237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48, skipping insertion in model container [2019-09-10 01:39:48,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,165 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:39:48,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:39:48,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:48,355 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:39:48,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:39:48,381 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:39:48,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48 WrapperNode [2019-09-10 01:39:48,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:39:48,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:39:48,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:39:48,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:39:48,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... [2019-09-10 01:39:48,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:39:48,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:39:48,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:39:48,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:39:48,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:39:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:39:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:39:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:39:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:39:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:39:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:39:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:39:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:39:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:39:48,731 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:39:48,732 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:39:48,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:48 BoogieIcfgContainer [2019-09-10 01:39:48,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:39:48,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:39:48,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:39:48,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:39:48,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:39:48" (1/3) ... [2019-09-10 01:39:48,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fceaf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:48, skipping insertion in model container [2019-09-10 01:39:48,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:39:48" (2/3) ... [2019-09-10 01:39:48,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fceaf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:39:48, skipping insertion in model container [2019-09-10 01:39:48,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:39:48" (3/3) ... [2019-09-10 01:39:48,740 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2019-09-10 01:39:48,750 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:39:48,757 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:39:48,774 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:39:48,819 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:39:48,820 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:39:48,820 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:39:48,820 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:39:48,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:39:48,821 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:39:48,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:39:48,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:39:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-10 01:39:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:39:48,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:48,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:48,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:48,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1296848067, now seen corresponding path program 1 times [2019-09-10 01:39:48,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:48,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:48,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:48,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:39:48,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:48,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:39:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:39:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:39:48,992 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-10 01:39:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:49,007 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-10 01:39:49,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:39:49,008 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 01:39:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:49,018 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:39:49,018 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:39:49,020 INFO L628 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-09-10 01:39:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:39:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:39:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:39:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-10 01:39:49,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-10 01:39:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:49,059 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-10 01:39:49,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:39:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-10 01:39:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:39:49,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:49,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:49,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1304236235, now seen corresponding path program 1 times [2019-09-10 01:39:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:49,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:49,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:39:49,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:49,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:39:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:39:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:39:49,132 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 3 states. [2019-09-10 01:39:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:49,154 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-09-10 01:39:49,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:39:49,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:39:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:49,156 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:39:49,156 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:39:49,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:39:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:39:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-09-10 01:39:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:39:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-10 01:39:49,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-09-10 01:39:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:49,165 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-10 01:39:49,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:39:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-10 01:39:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:39:49,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:49,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:49,167 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1302508357, now seen corresponding path program 1 times [2019-09-10 01:39:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:49,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:49,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:39:49,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:49,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:39:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:39:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:39:49,313 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2019-09-10 01:39:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:49,406 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 01:39:49,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:39:49,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-10 01:39:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:49,409 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:39:49,409 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:39:49,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:39:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:39:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-09-10 01:39:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 01:39:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-10 01:39:49,419 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2019-09-10 01:39:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:49,420 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-10 01:39:49,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:39:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-10 01:39:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:39:49,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:49,428 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:49,428 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1114370205, now seen corresponding path program 1 times [2019-09-10 01:39:49,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:39:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:39:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:39:49,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:39:49,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:39:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:39:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:39:49,562 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-09-10 01:39:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:49,641 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-09-10 01:39:49,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:39:49,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-09-10 01:39:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:49,643 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:39:49,643 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:39:49,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:39:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:39:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-09-10 01:39:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:39:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-10 01:39:49,650 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2019-09-10 01:39:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:49,650 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-10 01:39:49,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:39:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-10 01:39:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:39:49,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:49,652 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:49,652 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1880620107, now seen corresponding path program 1 times [2019-09-10 01:39:49,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:49,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:49,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:49,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:49,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-10 01:39:49,697 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [16], [23], [26], [28], [31], [33], [34], [35], [36], [38], [39], [40], [41], [42] [2019-09-10 01:39:49,730 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:39:49,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:39:49,792 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:39:49,793 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:39:50,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:39:50,005 INFO L272 AbstractInterpreter]: Visited 18 different actions 164 times. Merged at 4 different actions 32 times. Widened at 1 different actions 4 times. Performed 252 root evaluator evaluations with a maximum evaluation depth of 5. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-10 01:39:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:50,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:39:50,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:50,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:50,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:50,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:50,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 01:39:50,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:50,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:50,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:50,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-10 01:39:50,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:50,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:39:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:39:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:39:50,137 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-09-10 01:39:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:50,166 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-10 01:39:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:39:50,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:39:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:50,167 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:39:50,167 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:39:50,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:39:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:39:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-10 01:39:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:39:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-10 01:39:50,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2019-09-10 01:39:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:50,174 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-10 01:39:50,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:39:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-10 01:39:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:39:50,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:50,175 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:50,175 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1878892229, now seen corresponding path program 1 times [2019-09-10 01:39:50,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:50,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:50,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:50,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:50,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:50,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:50,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-10 01:39:50,283 INFO L207 CegarAbsIntRunner]: [0], [4], [12], [16], [23], [26], [28], [31], [33], [34], [35], [36], [38], [39], [40], [41] [2019-09-10 01:39:50,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:39:50,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:39:50,288 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:39:50,288 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:39:50,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:39:50,406 INFO L272 AbstractInterpreter]: Visited 16 different actions 149 times. Merged at 4 different actions 32 times. Widened at 1 different actions 4 times. Performed 238 root evaluator evaluations with a maximum evaluation depth of 5. Performed 238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-10 01:39:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:50,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:39:50,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:50,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:50,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:50,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:50,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 01:39:50,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:50,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:50,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 01:39:50,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2019-09-10 01:39:50,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:50,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:39:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:39:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:39:50,644 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 11 states. [2019-09-10 01:39:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:50,743 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-10 01:39:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:39:50,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-09-10 01:39:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:50,744 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:39:50,744 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:39:50,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:39:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:39:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-09-10 01:39:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:39:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-10 01:39:50,751 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 22 [2019-09-10 01:39:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:50,751 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-10 01:39:50,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:39:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-10 01:39:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:39:50,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:50,753 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:50,753 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash 524266525, now seen corresponding path program 2 times [2019-09-10 01:39:50,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:50,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:50,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:50,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:50,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 01:39:50,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:50,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:50,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:50,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:50,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:50,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:50,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:50,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:39:50,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:39:50,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:50,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 01:39:50,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:50,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 01:39:50,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 01:39:51,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2019-09-10 01:39:51,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:51,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:39:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:39:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:39:51,048 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2019-09-10 01:39:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:51,140 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-09-10 01:39:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:39:51,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-10 01:39:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:51,142 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:39:51,142 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:39:51,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:39:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:39:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-10 01:39:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:39:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-10 01:39:51,148 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2019-09-10 01:39:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:51,148 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-10 01:39:51,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:39:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-10 01:39:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:39:51,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:51,150 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:51,150 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1676519371, now seen corresponding path program 2 times [2019-09-10 01:39:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:51,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:51,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:51,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:51,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:51,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:51,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:51,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:51,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:39:51,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:51,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:39:51,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:51,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-10 01:39:51,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:51,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:39:51,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:39:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:39:51,338 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-09-10 01:39:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:51,379 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-10 01:39:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:39:51,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-09-10 01:39:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:51,381 INFO L225 Difference]: With dead ends: 44 [2019-09-10 01:39:51,381 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 01:39:51,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:39:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 01:39:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-09-10 01:39:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 01:39:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-09-10 01:39:51,393 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2019-09-10 01:39:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:51,394 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-09-10 01:39:51,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:39:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-09-10 01:39:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:39:51,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:51,397 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:51,397 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1674791493, now seen corresponding path program 3 times [2019-09-10 01:39:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:51,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:51,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:51,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:51,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:51,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:51,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:39:51,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:51,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:39:51,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:51,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 01:39:51,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:51,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 01:39:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2019-09-10 01:39:51,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:51,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:39:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:39:51,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:39:51,780 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2019-09-10 01:39:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:51,924 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-10 01:39:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:39:51,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-10 01:39:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:51,925 INFO L225 Difference]: With dead ends: 50 [2019-09-10 01:39:51,925 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:39:51,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:39:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:39:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-09-10 01:39:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 01:39:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-10 01:39:51,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 34 [2019-09-10 01:39:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:51,932 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-10 01:39:51,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:39:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-10 01:39:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 01:39:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:51,933 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:51,933 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1322657693, now seen corresponding path program 4 times [2019-09-10 01:39:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:51,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 01:39:52,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:52,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:52,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:52,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:52,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:52,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:52,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 01:39:52,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:52,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 01:39:52,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 01:39:52,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:52,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2019-09-10 01:39:52,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:52,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:39:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:39:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:39:52,277 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-09-10 01:39:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:52,381 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-09-10 01:39:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:39:52,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-09-10 01:39:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:52,383 INFO L225 Difference]: With dead ends: 54 [2019-09-10 01:39:52,383 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 01:39:52,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:39:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 01:39:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-09-10 01:39:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 01:39:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-10 01:39:52,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2019-09-10 01:39:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:52,393 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-10 01:39:52,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:39:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-10 01:39:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 01:39:52,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:52,397 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:52,397 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash -119411531, now seen corresponding path program 3 times [2019-09-10 01:39:52,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:52,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:52,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:52,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 01:39:52,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:52,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:52,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:52,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:39:52,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:39:52,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:39:52,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:52,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:39:52,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 01:39:52,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 01:39:52,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:52,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-10 01:39:52,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:52,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:39:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:39:52,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:39:52,581 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-09-10 01:39:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:52,623 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-09-10 01:39:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:39:52,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-10 01:39:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:52,628 INFO L225 Difference]: With dead ends: 56 [2019-09-10 01:39:52,628 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 01:39:52,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:39:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 01:39:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-10 01:39:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 01:39:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-09-10 01:39:52,635 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 46 [2019-09-10 01:39:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:52,635 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-09-10 01:39:52,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:39:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-09-10 01:39:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 01:39:52,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:52,636 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:52,636 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:52,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash -117683653, now seen corresponding path program 5 times [2019-09-10 01:39:52,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:52,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:52,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 01:39:52,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:52,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:52,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:52,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:52,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:52,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:39:52,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:39:52,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:52,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 01:39:52,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:52,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 01:39:52,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:52,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:53,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:53,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-10 01:39:53,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:53,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 17 [2019-09-10 01:39:53,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:53,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:39:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:39:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:39:53,047 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2019-09-10 01:39:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:53,525 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-09-10 01:39:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:39:53,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-09-10 01:39:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:53,526 INFO L225 Difference]: With dead ends: 62 [2019-09-10 01:39:53,526 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 01:39:53,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:39:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 01:39:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-09-10 01:39:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 01:39:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-10 01:39:53,533 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 46 [2019-09-10 01:39:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:53,534 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-10 01:39:53,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:39:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-10 01:39:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 01:39:53,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:53,535 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:53,535 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1737047755, now seen corresponding path program 4 times [2019-09-10 01:39:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:53,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:53,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 01:39:53,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:53,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:53,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:53,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:53,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:53,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:53,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:53,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:53,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:39:53,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 01:39:53,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 01:39:53,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:53,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-10 01:39:53,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:53,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:39:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:39:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:39:53,737 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 7 states. [2019-09-10 01:39:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:53,796 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-09-10 01:39:53,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:39:53,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 01:39:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:53,798 INFO L225 Difference]: With dead ends: 62 [2019-09-10 01:39:53,798 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 01:39:53,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:39:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 01:39:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-09-10 01:39:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 01:39:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-09-10 01:39:53,804 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 58 [2019-09-10 01:39:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:53,804 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-09-10 01:39:53,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:39:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-09-10 01:39:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 01:39:53,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:53,806 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:53,806 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1022416309, now seen corresponding path program 5 times [2019-09-10 01:39:53,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:53,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 01:39:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:53,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:53,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:53,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:53,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:53,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:53,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:53,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:53,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 01:39:53,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:53,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:39:53,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 01:39:53,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 01:39:54,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:54,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-10 01:39:54,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:54,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:39:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:39:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:39:54,059 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 8 states. [2019-09-10 01:39:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:54,126 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-09-10 01:39:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:39:54,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-10 01:39:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:54,129 INFO L225 Difference]: With dead ends: 66 [2019-09-10 01:39:54,129 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 01:39:54,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:39:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 01:39:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-10 01:39:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 01:39:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-09-10 01:39:54,137 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 70 [2019-09-10 01:39:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:54,138 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-09-10 01:39:54,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:39:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-09-10 01:39:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 01:39:54,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:54,140 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:54,140 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2020616757, now seen corresponding path program 6 times [2019-09-10 01:39:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 01:39:54,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:54,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:54,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:54,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:54,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:54,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:54,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:39:54,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:39:54,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:39:54,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:54,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:39:54,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 01:39:54,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 01:39:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:54,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-10 01:39:54,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:54,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:39:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:39:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:39:54,435 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2019-09-10 01:39:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:54,505 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-09-10 01:39:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:39:54,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 01:39:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:54,509 INFO L225 Difference]: With dead ends: 70 [2019-09-10 01:39:54,509 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 01:39:54,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:39:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 01:39:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-09-10 01:39:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 01:39:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-09-10 01:39:54,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 82 [2019-09-10 01:39:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:54,523 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-09-10 01:39:54,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:39:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-09-10 01:39:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 01:39:54,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:54,525 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:54,525 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1391149387, now seen corresponding path program 7 times [2019-09-10 01:39:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 01:39:54,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:54,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:54,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:54,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:54,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:54,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:54,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:54,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:39:54,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 01:39:54,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 01:39:54,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:54,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-10 01:39:54,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:54,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:39:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:39:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:39:54,843 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 10 states. [2019-09-10 01:39:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:54,927 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-09-10 01:39:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:39:54,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 01:39:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:54,930 INFO L225 Difference]: With dead ends: 74 [2019-09-10 01:39:54,930 INFO L226 Difference]: Without dead ends: 74 [2019-09-10 01:39:54,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:39:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-10 01:39:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-09-10 01:39:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:39:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-09-10 01:39:54,936 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 94 [2019-09-10 01:39:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:54,937 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-09-10 01:39:54,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:39:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-09-10 01:39:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 01:39:54,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:54,951 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:54,951 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 218010421, now seen corresponding path program 8 times [2019-09-10 01:39:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:54,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 32 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 01:39:55,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:55,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:55,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:55,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:55,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:55,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:55,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:55,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:39:55,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 01:39:55,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:55,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 01:39:55,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 32 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 01:39:55,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 32 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 01:39:55,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-10 01:39:55,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:55,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:39:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:39:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:39:55,406 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 11 states. [2019-09-10 01:39:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:55,526 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2019-09-10 01:39:55,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:39:55,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2019-09-10 01:39:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:55,528 INFO L225 Difference]: With dead ends: 78 [2019-09-10 01:39:55,528 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 01:39:55,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:39:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 01:39:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-09-10 01:39:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 01:39:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-09-10 01:39:55,533 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 106 [2019-09-10 01:39:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:55,534 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-09-10 01:39:55,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:39:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-09-10 01:39:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 01:39:55,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:55,536 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:55,536 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1706186827, now seen corresponding path program 9 times [2019-09-10 01:39:55,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:55,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:55,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:55,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:55,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 36 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 01:39:55,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:55,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:55,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:55,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:55,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:55,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:39:55,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:39:55,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:55,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:39:55,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:55,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:39:55,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 36 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 01:39:55,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 36 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 01:39:55,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:55,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-10 01:39:55,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:55,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:39:55,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:39:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:39:55,987 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 12 states. [2019-09-10 01:39:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:56,083 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2019-09-10 01:39:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:39:56,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 01:39:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:56,084 INFO L225 Difference]: With dead ends: 82 [2019-09-10 01:39:56,084 INFO L226 Difference]: Without dead ends: 82 [2019-09-10 01:39:56,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:39:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-10 01:39:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-10 01:39:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-10 01:39:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2019-09-10 01:39:56,089 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 118 [2019-09-10 01:39:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:56,090 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2019-09-10 01:39:56,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:39:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2019-09-10 01:39:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 01:39:56,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:56,092 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:56,092 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 656538677, now seen corresponding path program 10 times [2019-09-10 01:39:56,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:56,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:56,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 40 proven. 190 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 01:39:56,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:56,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:56,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:56,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:56,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:56,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:56,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:56,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:56,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 01:39:56,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 40 proven. 190 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 01:39:56,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 40 proven. 190 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 01:39:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-10 01:39:56,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:56,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:39:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:39:56,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:39:56,556 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 13 states. [2019-09-10 01:39:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:56,702 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-09-10 01:39:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:39:56,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2019-09-10 01:39:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:56,706 INFO L225 Difference]: With dead ends: 86 [2019-09-10 01:39:56,706 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 01:39:56,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:39:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 01:39:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-09-10 01:39:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 01:39:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2019-09-10 01:39:56,717 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 130 [2019-09-10 01:39:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:56,718 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2019-09-10 01:39:56,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:39:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2019-09-10 01:39:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 01:39:56,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:56,723 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:56,723 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1436258485, now seen corresponding path program 11 times [2019-09-10 01:39:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:56,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:56,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 44 proven. 231 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-10 01:39:56,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:56,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:56,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:56,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:56,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:56,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:56,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:39:56,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 01:39:56,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:56,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:39:56,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 44 proven. 231 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-10 01:39:56,959 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 44 proven. 231 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-10 01:39:57,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-10 01:39:57,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:57,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 01:39:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 01:39:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:39:57,197 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 14 states. [2019-09-10 01:39:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:57,357 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-09-10 01:39:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:39:57,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2019-09-10 01:39:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:57,359 INFO L225 Difference]: With dead ends: 90 [2019-09-10 01:39:57,359 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 01:39:57,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:39:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 01:39:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-09-10 01:39:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 01:39:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2019-09-10 01:39:57,366 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 142 [2019-09-10 01:39:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:57,367 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2019-09-10 01:39:57,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 01:39:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2019-09-10 01:39:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 01:39:57,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:57,369 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:57,369 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1747294923, now seen corresponding path program 12 times [2019-09-10 01:39:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:57,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:57,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 48 proven. 276 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-10 01:39:57,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:57,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:57,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:57,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:57,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:57,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:39:57,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:39:57,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:39:57,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:57,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 01:39:57,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 48 proven. 276 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-10 01:39:57,619 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 48 proven. 276 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-10 01:39:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-10 01:39:57,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:57,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:39:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:39:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 01:39:57,880 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 15 states. [2019-09-10 01:39:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:58,040 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2019-09-10 01:39:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:39:58,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 154 [2019-09-10 01:39:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:58,043 INFO L225 Difference]: With dead ends: 94 [2019-09-10 01:39:58,043 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 01:39:58,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 01:39:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 01:39:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-09-10 01:39:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-10 01:39:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-09-10 01:39:58,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 154 [2019-09-10 01:39:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:58,050 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-09-10 01:39:58,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:39:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-09-10 01:39:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 01:39:58,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:58,066 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:58,066 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 805206453, now seen corresponding path program 13 times [2019-09-10 01:39:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:58,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:39:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:58,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 52 proven. 325 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-10 01:39:58,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:58,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:58,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:58,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:58,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:58,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:58,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:58,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:39:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:58,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 01:39:58,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 52 proven. 325 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-10 01:39:58,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:39:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 52 proven. 325 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 01:39:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:39:58,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-10 01:39:58,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:39:58,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:39:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:39:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:39:58,666 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 16 states. [2019-09-10 01:39:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:39:58,887 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2019-09-10 01:39:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:39:58,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-09-10 01:39:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:39:58,889 INFO L225 Difference]: With dead ends: 98 [2019-09-10 01:39:58,889 INFO L226 Difference]: Without dead ends: 98 [2019-09-10 01:39:58,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:39:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-10 01:39:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2019-09-10 01:39:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-10 01:39:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-09-10 01:39:58,896 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 166 [2019-09-10 01:39:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:39:58,897 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-09-10 01:39:58,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:39:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-09-10 01:39:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 01:39:58,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:39:58,900 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:39:58,900 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:39:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:39:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash 807915061, now seen corresponding path program 14 times [2019-09-10 01:39:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:39:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:39:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:39:58,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:39:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:39:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 56 proven. 378 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-10 01:39:59,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:59,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:39:59,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:39:59,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:39:59,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:39:59,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:39:59,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:39:59,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:39:59,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 01:39:59,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:39:59,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-10 01:39:59,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:39:59,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:39:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 422 proven. 225 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2019-09-10 01:39:59,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:40:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:40:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 440 proven. 132 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2019-09-10 01:40:00,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:40:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 17] total 49 [2019-09-10 01:40:00,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:40:00,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 01:40:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 01:40:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1936, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 01:40:00,451 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 35 states. [2019-09-10 01:40:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:40:01,940 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2019-09-10 01:40:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 01:40:01,941 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 178 [2019-09-10 01:40:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:40:01,942 INFO L225 Difference]: With dead ends: 100 [2019-09-10 01:40:01,943 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:40:01,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1154, Invalid=4102, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 01:40:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:40:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:40:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:40:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:40:01,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-09-10 01:40:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:40:01,946 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:40:01,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 01:40:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:40:01,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:40:01,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:40:01 BoogieIcfgContainer [2019-09-10 01:40:01,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:40:01,955 INFO L168 Benchmark]: Toolchain (without parser) took 13803.78 ms. Allocated memory was 142.6 MB in the beginning and 424.1 MB in the end (delta: 281.5 MB). Free memory was 90.6 MB in the beginning and 84.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,955 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.47 ms. Allocated memory is still 142.6 MB. Free memory was 90.4 MB in the beginning and 81.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,957 INFO L168 Benchmark]: Boogie Preprocessor took 114.23 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 81.1 MB in the beginning and 178.6 MB in the end (delta: -97.5 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,958 INFO L168 Benchmark]: RCFGBuilder took 236.07 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 168.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,959 INFO L168 Benchmark]: TraceAbstraction took 13218.33 ms. Allocated memory was 201.3 MB in the beginning and 424.1 MB in the end (delta: 222.8 MB). Free memory was 167.5 MB in the beginning and 84.0 MB in the end (delta: 83.6 MB). Peak memory consumption was 306.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:40:01,965 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.21 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 231.47 ms. Allocated memory is still 142.6 MB. Free memory was 90.4 MB in the beginning and 81.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.23 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 81.1 MB in the beginning and 178.6 MB in the end (delta: -97.5 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 236.07 ms. Allocated memory is still 201.3 MB. Free memory was 178.6 MB in the beginning and 168.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13218.33 ms. Allocated memory was 201.3 MB in the beginning and 424.1 MB in the end (delta: 222.8 MB). Free memory was 167.5 MB in the beginning and 84.0 MB in the end (delta: 83.6 MB). Peak memory consumption was 306.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 4 procedures, 21 locations, 1 error locations. SAFE Result, 13.1s OverallTime, 23 OverallIterations, 29 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 619 SDtfs, 199 SDslu, 2376 SDs, 0 SdLazy, 2372 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3357 GetRequests, 2982 SyntacticMatches, 6 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 68 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3132 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 4688 ConstructedInterpolants, 0 QuantifiedInterpolants, 1253564 SizeOfPredicates, 82 NumberOfNonLiveVariables, 3831 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 61 InterpolantComputations, 4 PerfectInterpolantSequences, 25330/30800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...