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/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:58:52,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:58:52,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:58:52,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:58:52,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:58:52,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:58:52,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:58:52,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:58:52,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:58:52,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:58:52,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:58:52,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:58:52,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:58:52,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:58:52,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:58:52,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:58:52,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:58:52,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:58:52,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:58:52,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:58:52,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:58:52,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:58:52,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:58:52,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:58:52,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:58:52,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:58:52,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:58:52,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:58:52,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:58:52,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:58:52,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:58:52,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:58:52,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:58:52,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:58:52,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:58:52,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:58:52,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:58:52,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:58:52,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:58:52,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:58:52,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:58:52,222 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-03 20:58:52,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:58:52,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:58:52,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:58:52,254 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:58:52,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:58:52,255 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:58:52,255 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:58:52,255 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:58:52,255 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:58:52,255 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:58:52,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:58:52,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:58:52,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:58:52,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:58:52,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:58:52,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:58:52,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:58:52,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:58:52,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:58:52,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:58:52,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:58:52,260 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:58:52,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:58:52,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:58:52,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:58:52,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:58:52,261 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:58:52,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:58:52,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:58:52,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:58:52,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:58:52,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:58:52,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:58:52,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:58:52,345 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:58:52,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2019-09-03 20:58:52,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4f5835e/ca280dca84924298aafdaaa6de59976e/FLAG565d0b4f0 [2019-09-03 20:58:52,860 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:58:52,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2019-09-03 20:58:52,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4f5835e/ca280dca84924298aafdaaa6de59976e/FLAG565d0b4f0 [2019-09-03 20:58:53,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4f5835e/ca280dca84924298aafdaaa6de59976e [2019-09-03 20:58:53,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:58:53,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:58:53,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:58:53,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:58:53,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:58:53,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9eabab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53, skipping insertion in model container [2019-09-03 20:58:53,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:58:53,259 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:58:53,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:58:53,428 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:58:53,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:58:53,457 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:58:53,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53 WrapperNode [2019-09-03 20:58:53,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:58:53,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:58:53,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:58:53,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:58:53,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (1/1) ... [2019-09-03 20:58:53,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:58:53,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:58:53,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:58:53,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:58:53,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (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-03 20:58:53,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:58:53,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:58:53,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:58:53,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:58:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:58:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:58:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:58:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:58:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:58:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:58:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:58:53,849 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:58:53,850 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:58:53,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:58:53 BoogieIcfgContainer [2019-09-03 20:58:53,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:58:53,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:58:53,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:58:53,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:58:53,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:58:53" (1/3) ... [2019-09-03 20:58:53,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b3ca32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:58:53, skipping insertion in model container [2019-09-03 20:58:53,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:58:53" (2/3) ... [2019-09-03 20:58:53,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b3ca32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:58:53, skipping insertion in model container [2019-09-03 20:58:53,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:58:53" (3/3) ... [2019-09-03 20:58:53,862 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-1.i [2019-09-03 20:58:53,876 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:58:53,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:58:53,903 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:58:53,942 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:58:53,942 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:58:53,942 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:58:53,942 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:58:53,943 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:58:53,943 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:58:53,943 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:58:53,943 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:58:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:58:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:58:53,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:53,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:53,968 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1266359381, now seen corresponding path program 1 times [2019-09-03 20:58:53,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,124 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-03 20:58:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:58:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:58:54,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:58:54,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:58:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:58:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:58:54,145 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-09-03 20:58:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:54,249 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-03 20:58:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:58:54,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:58:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:54,263 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:58:54,263 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:58:54,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:58:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:58:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-09-03 20:58:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:58:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:58:54,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 20:58:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:54,301 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:58:54,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:58:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:58:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:58:54,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:54,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:54,303 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1008321469, now seen corresponding path program 1 times [2019-09-03 20:58:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:58:54,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:58:54,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:58:54,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:58:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:58:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:58:54,358 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2019-09-03 20:58:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:54,393 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:58:54,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:58:54,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-03 20:58:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:54,395 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:58:54,395 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:58:54,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:58:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:58:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-03 20:58:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:58:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 20:58:54,400 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-09-03 20:58:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:54,400 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 20:58:54,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:58:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 20:58:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:58:54,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:54,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:54,402 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1823795457, now seen corresponding path program 1 times [2019-09-03 20:58:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:54,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-03 20:58:54,462 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [18], [20], [26], [28], [30], [34], [41], [44], [46], [52], [53], [54], [56] [2019-09-03 20:58:54,496 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:58:54,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:58:54,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:58:54,659 INFO L272 AbstractInterpreter]: Visited 17 different actions 90 times. Merged at 6 different actions 42 times. Widened at 3 different actions 11 times. Performed 221 root evaluator evaluations with a maximum evaluation depth of 4. Performed 221 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 3 different actions. Largest state had 10 variables. [2019-09-03 20:58:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:58:54,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,664 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-03 20:58:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:58:54,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-09-03 20:58:54,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:54,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:58:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:58:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:58:54,848 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-03 20:58:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:54,907 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-03 20:58:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:58:54,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-03 20:58:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:54,910 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:58:54,910 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:58:54,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:58:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:58:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-03 20:58:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:58:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 20:58:54,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-03 20:58:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:54,915 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 20:58:54,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:58:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 20:58:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:58:54,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:54,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:54,917 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash 478895679, now seen corresponding path program 2 times [2019-09-03 20:58:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:58:54,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:54,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:54,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:54,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,974 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-03 20:58:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:54,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:55,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:58:55,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:55,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:58:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:58:55,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:58:55,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:55,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-09-03 20:58:55,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:55,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:58:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:58:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:58:55,106 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-09-03 20:58:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:55,145 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-03 20:58:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:58:55,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-03 20:58:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:55,150 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:58:55,150 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:58:55,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:58:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:58:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-09-03 20:58:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:58:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 20:58:55,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2019-09-03 20:58:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:55,162 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 20:58:55,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:58:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 20:58:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:58:55,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:55,164 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:55,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 525702443, now seen corresponding path program 3 times [2019-09-03 20:58:55,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:58:55,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:55,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:55,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:55,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,280 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-03 20:58:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:55,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:55,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:55,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:55,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:58:55,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:58:55,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:58:55,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-09-03 20:58:55,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:55,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:58:55,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:58:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:58:55,418 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-09-03 20:58:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:55,462 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-03 20:58:55,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:58:55,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-03 20:58:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:55,468 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:58:55,468 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:58:55,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:58:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:58:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-03 20:58:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:58:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 20:58:55,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2019-09-03 20:58:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:55,476 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 20:58:55,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:58:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 20:58:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:58:55,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:55,483 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:55,483 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -441049109, now seen corresponding path program 4 times [2019-09-03 20:58:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-03 20:58:55,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:55,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:55,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:55,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,565 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-03 20:58:55,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:55,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:55,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:58:55,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-03 20:58:55,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-03 20:58:55,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:55,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-03 20:58:55,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:55,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:58:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:58:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:58:55,740 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-03 20:58:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:55,789 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 20:58:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:58:55,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-03 20:58:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:55,793 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:58:55,793 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:58:55,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:58:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:58:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:58:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:58:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-03 20:58:55,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-09-03 20:58:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:55,806 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-03 20:58:55,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:58:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-03 20:58:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:58:55,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:55,809 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:55,810 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:55,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1891685973, now seen corresponding path program 5 times [2019-09-03 20:58:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:55,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:58:55,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:55,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:55,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:55,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:55,931 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-03 20:58:55,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:55,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:55,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:58:55,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:55,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:58:55,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-03 20:58:56,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-03 20:58:56,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:56,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-09-03 20:58:56,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:56,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:58:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:58:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:58:56,141 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 13 states. [2019-09-03 20:58:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:56,190 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-03 20:58:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:58:56,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-03 20:58:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:56,192 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:58:56,192 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:58:56,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:58:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:58:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-03 20:58:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:58:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-03 20:58:56,200 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2019-09-03 20:58:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:56,200 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-03 20:58:56,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:58:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-03 20:58:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:58:56,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:56,202 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:56,202 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -98733461, now seen corresponding path program 6 times [2019-09-03 20:58:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 20:58:56,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:56,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:56,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:56,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:56,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:56,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:56,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:56,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:58:56,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 20:58:56,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 20:58:56,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2019-09-03 20:58:56,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:56,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:58:56,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:58:56,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:58:56,545 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 15 states. [2019-09-03 20:58:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:56,599 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-03 20:58:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:58:56,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-09-03 20:58:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:56,600 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:58:56,600 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:58:56,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:58:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:58:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-03 20:58:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:58:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-09-03 20:58:56,605 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2019-09-03 20:58:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:56,606 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-09-03 20:58:56,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:58:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-09-03 20:58:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:58:56,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:56,607 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:56,608 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148565, now seen corresponding path program 7 times [2019-09-03 20:58:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:56,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-03 20:58:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:56,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:56,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,709 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-03 20:58:56,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:56,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:58:56,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-03 20:58:56,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:58:56,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:56,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-03 20:58:56,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:56,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:58:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:58:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:58:56,927 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 17 states. [2019-09-03 20:58:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:56,989 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-09-03 20:58:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:58:56,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-09-03 20:58:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:56,993 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:58:56,993 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:58:56,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:58:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:58:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-03 20:58:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:58:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-03 20:58:56,998 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2019-09-03 20:58:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:56,998 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-03 20:58:56,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:58:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-03 20:58:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:58:56,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:57,000 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:57,000 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1034108693, now seen corresponding path program 8 times [2019-09-03 20:58:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 115 proven. 49 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:58:57,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:57,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:57,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:57,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,095 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-03 20:58:57,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:57,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:57,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:58:57,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:57,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:58:57,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 116 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-03 20:58:57,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 3 proven. 162 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-03 20:58:57,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:57,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2019-09-03 20:58:57,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:57,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:58:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:58:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:58:57,376 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 19 states. [2019-09-03 20:58:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:57,437 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-03 20:58:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:58:57,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2019-09-03 20:58:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:57,443 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:58:57,443 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:58:57,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:58:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:58:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-03 20:58:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:58:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-09-03 20:58:57,450 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2019-09-03 20:58:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:57,451 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-09-03 20:58:57,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:58:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-09-03 20:58:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:58:57,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:57,453 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:57,453 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2048440661, now seen corresponding path program 9 times [2019-09-03 20:58:57,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:58:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:57,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:57,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:57,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,577 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-03 20:58:57,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:57,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:57,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:57,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:57,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:58:57,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:58:57,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 147 proven. 64 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:58:57,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:57,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:58:57,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:57,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:58:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:58:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:58:57,935 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 21 states. [2019-09-03 20:58:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:58,033 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-09-03 20:58:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:58:58,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-09-03 20:58:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:58,035 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:58:58,036 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:58:58,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:58:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:58:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-03 20:58:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:58:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-09-03 20:58:58,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2019-09-03 20:58:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:58,051 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-09-03 20:58:58,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:58:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-09-03 20:58:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:58:58,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:58,053 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:58,055 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash -820376725, now seen corresponding path program 10 times [2019-09-03 20:58:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 183 proven. 81 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-03 20:58:58,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:58,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:58,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:58,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:58,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:58:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 183 proven. 81 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-03 20:58:58,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 183 proven. 81 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-03 20:58:58,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:58,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2019-09-03 20:58:58,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:58,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:58:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:58:58,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:58:58,490 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 23 states. [2019-09-03 20:58:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:58,557 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 20:58:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:58:58,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-09-03 20:58:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:58,558 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:58:58,558 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:58:58,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:58:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:58:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-03 20:58:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:58:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-03 20:58:58,564 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2019-09-03 20:58:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:58,564 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-03 20:58:58,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:58:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-03 20:58:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:58:58,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:58,566 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:58,566 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 233951019, now seen corresponding path program 11 times [2019-09-03 20:58:58,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-03 20:58:58,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:58,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:58,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:58,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,618 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-03 20:58:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:58,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:58,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 20:58:58,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:58,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:58:58,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-03 20:58:58,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-03 20:58:58,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-09-03 20:58:58,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:58,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:58:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:58:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:58:58,801 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2019-09-03 20:58:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:58,821 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-09-03 20:58:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:58:58,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-03 20:58:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:58,824 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:58:58,824 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:58:58,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:58:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:58:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2019-09-03 20:58:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:58:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-09-03 20:58:58,838 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 58 [2019-09-03 20:58:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:58,839 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-09-03 20:58:58,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:58:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-09-03 20:58:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:58:58,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:58,840 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:58,841 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1348099759, now seen corresponding path program 12 times [2019-09-03 20:58:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:58,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-03 20:58:58,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:58,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:58,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:58,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:58,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:58,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:59,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:59,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:59,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:58:59,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-03 20:58:59,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-03 20:58:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-09-03 20:58:59,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:59,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:58:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:58:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:58:59,158 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 11 states. [2019-09-03 20:58:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:59,194 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2019-09-03 20:58:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:58:59,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-03 20:58:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:59,196 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:58:59,196 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 20:58:59,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:58:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 20:58:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2019-09-03 20:58:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:58:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-09-03 20:58:59,218 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 81 [2019-09-03 20:58:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:59,219 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-09-03 20:58:59,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:58:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-09-03 20:58:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:58:59,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:59,221 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:59,221 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1467049301, now seen corresponding path program 13 times [2019-09-03 20:58:59,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:59,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:58:59,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:59,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:59,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:59,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,347 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) [2019-09-03 20:58:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:59,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:59,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:58:59,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:58:59,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:58:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:59,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-09-03 20:58:59,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:59,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:58:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:58:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:58:59,604 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 13 states. [2019-09-03 20:58:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:59,648 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-09-03 20:58:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:58:59,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-03 20:58:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:59,650 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:58:59,650 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:58:59,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:58:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:58:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 128. [2019-09-03 20:58:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:58:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2019-09-03 20:58:59,663 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 104 [2019-09-03 20:58:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:59,664 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2019-09-03 20:58:59,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:58:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2019-09-03 20:58:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:58:59,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:59,670 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:59,671 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1018125521, now seen corresponding path program 14 times [2019-09-03 20:58:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-09-03 20:58:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:59,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:59,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,812 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-03 20:58:59,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:59,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:59,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 20:58:59,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:59,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:58:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-09-03 20:59:00,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-09-03 20:59:00,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:00,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2019-09-03 20:59:00,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:00,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:59:00,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:59:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:59:00,223 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 15 states. [2019-09-03 20:59:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:00,260 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2019-09-03 20:59:00,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:59:00,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2019-09-03 20:59:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:00,262 INFO L225 Difference]: With dead ends: 173 [2019-09-03 20:59:00,263 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:59:00,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:59:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:59:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2019-09-03 20:59:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:59:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2019-09-03 20:59:00,268 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 127 [2019-09-03 20:59:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:00,269 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2019-09-03 20:59:00,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:59:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2019-09-03 20:59:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:59:00,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:00,271 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:00,271 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1416411605, now seen corresponding path program 15 times [2019-09-03 20:59:00,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:00,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:00,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 20:59:00,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:00,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:00,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:00,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:00,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:00,433 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-03 20:59:00,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:00,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:00,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:00,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:00,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:59:00,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 20:59:00,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 20:59:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-03 20:59:00,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:00,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:59:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:59:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:59:00,753 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 17 states. [2019-09-03 20:59:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:00,814 INFO L93 Difference]: Finished difference Result 196 states and 204 transitions. [2019-09-03 20:59:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:59:00,815 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2019-09-03 20:59:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:00,817 INFO L225 Difference]: With dead ends: 196 [2019-09-03 20:59:00,817 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 20:59:00,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 286 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:59:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 20:59:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2019-09-03 20:59:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 20:59:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 181 transitions. [2019-09-03 20:59:00,822 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 181 transitions. Word has length 150 [2019-09-03 20:59:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:00,823 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 181 transitions. [2019-09-03 20:59:00,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:59:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 181 transitions. [2019-09-03 20:59:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:59:00,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:00,825 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:00,826 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1492973649, now seen corresponding path program 16 times [2019-09-03 20:59:00,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:00,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:00,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-09-03 20:59:01,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:01,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:01,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:01,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:01,068 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-03 20:59:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:01,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:01,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:59:01,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-09-03 20:59:01,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-09-03 20:59:01,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2019-09-03 20:59:01,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:01,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:59:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:59:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:59:01,534 INFO L87 Difference]: Start difference. First operand 174 states and 181 transitions. Second operand 19 states. [2019-09-03 20:59:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:01,607 INFO L93 Difference]: Finished difference Result 219 states and 228 transitions. [2019-09-03 20:59:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:59:01,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 173 [2019-09-03 20:59:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:01,610 INFO L225 Difference]: With dead ends: 219 [2019-09-03 20:59:01,611 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 20:59:01,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 330 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:59:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 20:59:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2019-09-03 20:59:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 20:59:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2019-09-03 20:59:01,617 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 173 [2019-09-03 20:59:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:01,618 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2019-09-03 20:59:01,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:59:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2019-09-03 20:59:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 20:59:01,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:01,620 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:01,621 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:01,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:01,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1547162027, now seen corresponding path program 17 times [2019-09-03 20:59:01,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-03 20:59:01,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:01,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:01,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:01,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:01,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:01,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:01,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:02,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 20:59:02,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:02,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:59:02,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-03 20:59:02,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-03 20:59:02,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:02,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:59:02,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:02,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:59:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:59:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:59:02,513 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 21 states. [2019-09-03 20:59:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:02,578 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2019-09-03 20:59:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:59:02,579 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 196 [2019-09-03 20:59:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:02,581 INFO L225 Difference]: With dead ends: 242 [2019-09-03 20:59:02,581 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 20:59:02,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 374 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:59:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 20:59:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 220. [2019-09-03 20:59:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 20:59:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 229 transitions. [2019-09-03 20:59:02,588 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 229 transitions. Word has length 196 [2019-09-03 20:59:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:02,588 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 229 transitions. [2019-09-03 20:59:02,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:59:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 229 transitions. [2019-09-03 20:59:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-03 20:59:02,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:02,591 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:02,591 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1463389231, now seen corresponding path program 18 times [2019-09-03 20:59:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:02,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:02,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 20:59:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:02,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:02,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:02,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:02,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:02,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:02,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:02,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:02,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:02,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:59:02,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 20:59:03,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:59:03,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:03,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2019-09-03 20:59:03,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:03,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:59:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:59:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:59:03,340 INFO L87 Difference]: Start difference. First operand 220 states and 229 transitions. Second operand 23 states. [2019-09-03 20:59:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:03,430 INFO L93 Difference]: Finished difference Result 265 states and 276 transitions. [2019-09-03 20:59:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:59:03,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 219 [2019-09-03 20:59:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:03,432 INFO L225 Difference]: With dead ends: 265 [2019-09-03 20:59:03,432 INFO L226 Difference]: Without dead ends: 265 [2019-09-03 20:59:03,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 418 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:59:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-03 20:59:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2019-09-03 20:59:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-03 20:59:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 253 transitions. [2019-09-03 20:59:03,439 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 253 transitions. Word has length 219 [2019-09-03 20:59:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:03,439 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 253 transitions. [2019-09-03 20:59:03,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:59:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 253 transitions. [2019-09-03 20:59:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-03 20:59:03,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:03,443 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:03,443 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1649132245, now seen corresponding path program 19 times [2019-09-03 20:59:03,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:03,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:03,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 11036 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:59:08,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:59:08,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2019-09-03 20:59:08,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:59:08,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:59:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:59:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:59:08,252 INFO L87 Difference]: Start difference. First operand 243 states and 253 transitions. Second operand 105 states. [2019-09-03 20:59:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:09,803 INFO L93 Difference]: Finished difference Result 9781 states and 10241 transitions. [2019-09-03 20:59:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:59:09,803 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 242 [2019-09-03 20:59:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:09,804 INFO L225 Difference]: With dead ends: 9781 [2019-09-03 20:59:09,804 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:59:09,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:59:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:59:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:59:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:59:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:59:09,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2019-09-03 20:59:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:09,808 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:59:09,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:59:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:59:09,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:59:09,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:59:09 BoogieIcfgContainer [2019-09-03 20:59:09,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:59:09,816 INFO L168 Benchmark]: Toolchain (without parser) took 16587.83 ms. Allocated memory was 135.8 MB in the beginning and 522.7 MB in the end (delta: 386.9 MB). Free memory was 86.6 MB in the beginning and 286.2 MB in the end (delta: -199.6 MB). Peak memory consumption was 187.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,817 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 104.9 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.70 ms. Allocated memory is still 135.8 MB. Free memory was 86.2 MB in the beginning and 77.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,819 INFO L168 Benchmark]: Boogie Preprocessor took 125.34 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 77.0 MB in the beginning and 176.3 MB in the end (delta: -99.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,820 INFO L168 Benchmark]: RCFGBuilder took 267.46 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 163.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,820 INFO L168 Benchmark]: TraceAbstraction took 15961.16 ms. Allocated memory was 198.7 MB in the beginning and 522.7 MB in the end (delta: 324.0 MB). Free memory was 163.7 MB in the beginning and 286.2 MB in the end (delta: -122.6 MB). Peak memory consumption was 201.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:59:09,824 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 135.8 MB. Free memory was 104.9 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 229.70 ms. Allocated memory is still 135.8 MB. Free memory was 86.2 MB in the beginning and 77.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.34 ms. Allocated memory was 135.8 MB in the beginning and 198.7 MB in the end (delta: 62.9 MB). Free memory was 77.0 MB in the beginning and 176.3 MB in the end (delta: -99.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 267.46 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 163.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15961.16 ms. Allocated memory was 198.7 MB in the beginning and 522.7 MB in the end (delta: 324.0 MB). Free memory was 163.7 MB in the beginning and 286.2 MB in the end (delta: -122.6 MB). Peak memory consumption was 201.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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, 23 locations, 1 error locations. SAFE Result, 15.8s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 674 SDtfs, 998 SDslu, 2671 SDs, 0 SdLazy, 1180 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3190 GetRequests, 2718 SyntacticMatches, 62 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3602 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 203 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 3197 NumberOfCodeBlocks, 3193 NumberOfCodeBlocksAsserted, 207 NumberOfCheckSat, 4604 ConstructedInterpolants, 0 QuantifiedInterpolants, 3078644 SizeOfPredicates, 52 NumberOfNonLiveVariables, 3665 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 27047/108471 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...