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/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:36:50,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:50,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:50,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:50,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:50,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:50,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:50,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:50,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:50,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:50,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:50,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:50,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:50,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:50,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:50,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:50,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:50,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:50,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:50,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:50,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:50,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:50,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:50,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:50,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:50,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:50,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:50,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:50,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:50,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:50,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:50,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:50,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:50,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:50,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:50,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:50,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:50,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:50,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:50,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:50,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:50,287 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:36:50,307 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:50,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:50,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:50,308 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:50,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:50,309 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:50,309 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:50,310 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:50,310 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:50,310 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:50,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:50,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:50,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:50,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:50,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:50,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:50,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:50,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:50,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:50,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:50,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:50,315 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:50,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:50,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:50,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:50,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:50,316 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:50,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:50,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:50,316 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:50,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:50,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:50,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:50,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:50,384 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:50,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2019-09-03 20:36:50,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e60776/9ba8329d475e44878f4863d11e19e433/FLAG175bbb6f4 [2019-09-03 20:36:50,907 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:50,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2019-09-03 20:36:50,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e60776/9ba8329d475e44878f4863d11e19e433/FLAG175bbb6f4 [2019-09-03 20:36:51,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4e60776/9ba8329d475e44878f4863d11e19e433 [2019-09-03 20:36:51,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:51,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:51,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:51,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:51,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:51,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0f7ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51, skipping insertion in model container [2019-09-03 20:36:51,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,359 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:51,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:51,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:51,546 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:51,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:51,580 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:51,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51 WrapperNode [2019-09-03 20:36:51,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:51,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:51,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:51,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:51,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (1/1) ... [2019-09-03 20:36:51,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:51,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:51,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:51,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:51,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (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:36:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:36:51,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:51,951 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:51,951 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:51,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:51 BoogieIcfgContainer [2019-09-03 20:36:51,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:51,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:51,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:51,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:51,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:51" (1/3) ... [2019-09-03 20:36:51,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ae7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:51, skipping insertion in model container [2019-09-03 20:36:51,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:51" (2/3) ... [2019-09-03 20:36:51,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ae7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:51, skipping insertion in model container [2019-09-03 20:36:51,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:51" (3/3) ... [2019-09-03 20:36:51,960 INFO L109 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2019-09-03 20:36:51,983 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:51,994 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:52,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:52,070 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:52,070 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:52,070 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:52,070 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:52,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:52,071 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:52,071 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:52,071 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:36:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:36:52,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:52,102 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1345568573, now seen corresponding path program 1 times [2019-09-03 20:36:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,392 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:36:52,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:52,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:36:52,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:52,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:36:52,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:36:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:52,415 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2019-09-03 20:36:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,510 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-09-03 20:36:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:36:52,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 20:36:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,521 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:36:52,522 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:36:52,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:36:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:36:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:36:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:36:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:36:52,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2019-09-03 20:36:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,571 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:36:52,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:36:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:36:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:36:52,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:52,575 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1402826875, now seen corresponding path program 1 times [2019-09-03 20:36:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,661 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:36:52,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:36:52,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:52,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:52,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:36:52,665 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-09-03 20:36:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:52,707 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-03 20:36:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:36:52,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:36:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:52,711 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:36:52,711 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:36:52,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:36:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:36:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:36:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 20:36:52,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2019-09-03 20:36:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:52,720 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 20:36:52,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 20:36:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:36:52,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:52,721 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:52,722 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1436486517, now seen corresponding path program 1 times [2019-09-03 20:36:52,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:52,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:52,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:52,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:52,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:52,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:52,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 20:36:52,819 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [20], [26], [29], [31], [34], [36], [37], [38], [39], [41], [42] [2019-09-03 20:36:52,855 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:52,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:52,924 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:36:53,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:53,565 INFO L272 AbstractInterpreter]: Visited 16 different actions 133 times. Merged at 5 different actions 38 times. Widened at 1 different actions 3 times. Performed 201 root evaluator evaluations with a maximum evaluation depth of 8. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 9 fixpoints after 3 different actions. Largest state had 7 variables. [2019-09-03 20:36:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:53,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:36:53,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:36:53,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:53,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:36:53,736 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-09-03 20:36:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,779 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-09-03 20:36:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:53,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 20:36:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,781 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:36:53,781 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:36:53,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:36:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:36:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 20:36:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:36:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 20:36:53,796 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-03 20:36:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,797 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 20:36:53,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 20:36:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:36:53,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,810 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,810 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1136980881, now seen corresponding path program 2 times [2019-09-03 20:36:53,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:36:53,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:53,942 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:36:53,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:53,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:06,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:06,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:06,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:37:06,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:37:06,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:37:06,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:06,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 20:37:06,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:06,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:37:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:37:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:06,187 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-09-03 20:37:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:06,232 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-03 20:37:06,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:37:06,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-03 20:37:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:06,234 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:37:06,234 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:37:06,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:37:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:37:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:37:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 20:37:06,240 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-03 20:37:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:06,240 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 20:37:06,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:37:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 20:37:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:37:06,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:06,242 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:06,242 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1851034775, now seen corresponding path program 3 times [2019-09-03 20:37:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:06,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:06,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:37:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:06,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:06,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:06,353 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:37:06,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:06,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:06,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:06,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:06,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:06,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:06,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:37:06,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:37:06,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:37:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:06,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:06,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:06,559 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-03 20:37:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:06,641 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-03 20:37:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:06,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-09-03 20:37:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:06,643 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:37:06,644 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:37:06,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:37:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 20:37:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:37:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-03 20:37:06,653 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2019-09-03 20:37:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-03 20:37:06,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-03 20:37:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:37:06,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:06,655 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:06,655 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 103432291, now seen corresponding path program 4 times [2019-09-03 20:37:06,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:06,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:06,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:37:06,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:06,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:06,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:06,799 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:37:06,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:06,799 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:37:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:06,815 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:37:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:06,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:37:06,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:37:06,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:37:07,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:07,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:37:07,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:07,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:37:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:37:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:07,003 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2019-09-03 20:37:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:07,108 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-03 20:37:07,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:37:07,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-03 20:37:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:07,110 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:37:07,110 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:37:07,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:37:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:37:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 20:37:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:37:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-09-03 20:37:07,121 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2019-09-03 20:37:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:07,121 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-09-03 20:37:07,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:37:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-09-03 20:37:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:37:07,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:07,124 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:07,124 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1878094685, now seen corresponding path program 5 times [2019-09-03 20:37:07,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:07,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:07,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:37:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:07,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:07,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:07,275 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:37:07,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:07,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:07,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:57,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:57,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:57,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:37:57,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:37:58,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:37:58,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:58,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 20:37:58,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:58,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:58,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:37:58,449 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2019-09-03 20:37:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:58,571 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-09-03 20:37:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:58,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-03 20:37:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:58,572 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:37:58,572 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:37:58,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:37:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:37:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 20:37:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:37:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-09-03 20:37:58,582 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 52 [2019-09-03 20:37:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:58,582 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-09-03 20:37:58,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-09-03 20:37:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:37:58,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:58,587 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:58,587 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1262160983, now seen corresponding path program 6 times [2019-09-03 20:37:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:58,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:58,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:37:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:58,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:58,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:58,779 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:37:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:58,780 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:37:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:58,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:58,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:58,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:58,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:37:58,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:37:58,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:37:59,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:59,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 20:37:59,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:59,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:37:59,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:37:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:59,074 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 10 states. [2019-09-03 20:37:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:59,203 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-09-03 20:37:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:37:59,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-09-03 20:37:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:59,205 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:37:59,205 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:37:59,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:37:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 20:37:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:37:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-09-03 20:37:59,211 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 60 [2019-09-03 20:37:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:59,211 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-09-03 20:37:59,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:37:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-09-03 20:37:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:37:59,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:59,213 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:59,213 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 977341265, now seen corresponding path program 7 times [2019-09-03 20:37:59,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:59,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:59,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:59,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:59,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:59,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:59,339 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:37:59,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:59,340 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:37:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:59,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:59,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:37:59,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:59,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:59,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:59,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:37:59,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:59,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:59,625 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2019-09-03 20:37:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:59,784 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-09-03 20:37:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:59,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-03 20:37:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:59,787 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:37:59,787 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:37:59,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:37:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 20:37:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:37:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-09-03 20:37:59,793 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 68 [2019-09-03 20:37:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:59,793 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-09-03 20:37:59,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-09-03 20:37:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:37:59,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:59,795 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:59,795 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash 87912523, now seen corresponding path program 8 times [2019-09-03 20:37:59,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:59,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:59,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:37:59,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:59,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:59,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:59,957 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:37:59,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:59,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:59,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:59,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:27,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:39:27,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:27,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:39:27,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:39:27,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:39:30,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:30,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-03 20:39:30,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:30,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:39:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:39:30,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:39:30,124 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 12 states. [2019-09-03 20:39:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:30,367 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-09-03 20:39:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:39:30,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-03 20:39:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:30,369 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:39:30,369 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:39:30,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:39:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:39:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 20:39:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:39:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-03 20:39:30,375 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 76 [2019-09-03 20:39:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:30,376 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-03 20:39:30,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:39:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-03 20:39:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:39:30,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:30,378 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:30,378 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1704314043, now seen corresponding path program 9 times [2019-09-03 20:39:30,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:30,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:30,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:39:30,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:30,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:30,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:30,575 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:39:30,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:30,576 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:39:30,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:30,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:30,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:30,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:30,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:39:30,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:39:30,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:39:30,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:30,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:39:30,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:30,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:39:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:39:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:39:30,935 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 13 states. [2019-09-03 20:39:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:31,252 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-03 20:39:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:39:31,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-09-03 20:39:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:31,255 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:39:31,255 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:39:31,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:39:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:39:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 20:39:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:39:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-09-03 20:39:31,261 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 84 [2019-09-03 20:39:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:31,262 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-09-03 20:39:31,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:39:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-09-03 20:39:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:39:31,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:31,263 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:31,264 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 234974271, now seen corresponding path program 10 times [2019-09-03 20:39:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:31,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:31,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:39:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 20:39:31,387 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 20:39:31,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:39:31 BoogieIcfgContainer [2019-09-03 20:39:31,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:39:31,464 INFO L168 Benchmark]: Toolchain (without parser) took 160119.37 ms. Allocated memory was 137.9 MB in the beginning and 335.0 MB in the end (delta: 197.1 MB). Free memory was 85.3 MB in the beginning and 265.8 MB in the end (delta: -180.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:39:31,465 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory is still 103.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:39:31,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.53 ms. Allocated memory is still 137.9 MB. Free memory was 85.3 MB in the beginning and 76.1 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:39:31,471 INFO L168 Benchmark]: Boogie Preprocessor took 131.32 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 76.1 MB in the beginning and 175.5 MB in the end (delta: -99.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:39:31,473 INFO L168 Benchmark]: RCFGBuilder took 238.72 ms. Allocated memory is still 198.2 MB. Free memory was 175.5 MB in the beginning and 164.1 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:39:31,473 INFO L168 Benchmark]: TraceAbstraction took 159505.95 ms. Allocated memory was 198.2 MB in the beginning and 335.0 MB in the end (delta: 136.8 MB). Free memory was 164.1 MB in the beginning and 265.8 MB in the end (delta: -101.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:39:31,482 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.22 ms. Allocated memory is still 137.9 MB. Free memory is still 103.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.53 ms. Allocated memory is still 137.9 MB. Free memory was 85.3 MB in the beginning and 76.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.32 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 76.1 MB in the beginning and 175.5 MB in the end (delta: -99.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 238.72 ms. Allocated memory is still 198.2 MB. Free memory was 175.5 MB in the beginning and 164.1 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159505.95 ms. Allocated memory was 198.2 MB in the beginning and 335.0 MB in the end (delta: 136.8 MB). Free memory was 164.1 MB in the beginning and 265.8 MB in the end (delta: -101.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 159.4s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 281 SDtfs, 72 SDslu, 1000 SDs, 0 SdLazy, 1187 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1022 GetRequests, 871 SyntacticMatches, 23 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 150.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1399 ConstructedInterpolants, 0 QuantifiedInterpolants, 326359 SizeOfPredicates, 7 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 1980/3690 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...