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/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:36:51,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:36:51,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:36:51,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:36:51,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:36:51,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:36:51,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:36:51,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:36:51,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:36:51,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:36:51,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:36:51,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:36:51,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:36:51,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:36:51,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:36:51,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:36:51,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:36:51,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:36:51,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:36:51,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:36:51,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:36:51,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:36:51,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:36:51,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:36:51,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:36:51,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:36:51,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:36:51,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:36:51,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:36:51,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:36:51,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:36:51,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:36:51,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:36:51,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:36:51,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:36:51,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:36:51,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:36:51,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:36:51,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:36:51,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:36:51,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:36:51,381 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:51,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:36:51,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:36:51,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:36:51,397 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:36:51,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:36:51,398 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:36:51,399 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:36:51,399 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:36:51,399 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:36:51,399 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:36:51,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:36:51,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:36:51,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:36:51,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:36:51,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:36:51,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:36:51,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:36:51,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:36:51,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:36:51,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:36:51,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:36:51,402 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:36:51,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:36:51,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:36:51,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:36:51,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:36:51,403 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:36:51,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:36:51,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:36:51,404 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:36:51,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:36:51,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:36:51,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:36:51,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:36:51,449 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:36:51,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2019-09-03 20:36:51,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e084e22/876cfcdd4ccf4a8e953c4c48be616343/FLAGe779f88a8 [2019-09-03 20:36:52,010 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:36:52,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-09-03 20:36:52,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e084e22/876cfcdd4ccf4a8e953c4c48be616343/FLAGe779f88a8 [2019-09-03 20:36:52,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e084e22/876cfcdd4ccf4a8e953c4c48be616343 [2019-09-03 20:36:52,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:36:52,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:36:52,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:52,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:36:52,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:36:52,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:52" (1/1) ... [2019-09-03 20:36:52,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d662fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:52, skipping insertion in model container [2019-09-03 20:36:52,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:36:52" (1/1) ... [2019-09-03 20:36:52,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:36:52,462 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:36:52,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:52,648 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:36:52,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:36:52,678 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:36:52,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:52 WrapperNode [2019-09-03 20:36:52,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:36:52,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:36:52,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:36:52,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:36:52,782 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:52" (1/1) ... [2019-09-03 20:36:52,783 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:52" (1/1) ... [2019-09-03 20:36:52,789 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:52" (1/1) ... [2019-09-03 20:36:52,789 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:52" (1/1) ... [2019-09-03 20:36:52,794 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:52" (1/1) ... [2019-09-03 20:36:52,799 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:52" (1/1) ... [2019-09-03 20:36:52,800 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:52" (1/1) ... [2019-09-03 20:36:52,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:36:52,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:36:52,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:36:52,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:36:52,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:52" (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:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:36:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:36:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:36:52,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:36:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:36:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:36:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:36:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:36:52,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:36:53,006 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:36:53,007 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:36:53,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:53 BoogieIcfgContainer [2019-09-03 20:36:53,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:36:53,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:36:53,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:36:53,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:36:53,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:36:52" (1/3) ... [2019-09-03 20:36:53,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42854e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:53, skipping insertion in model container [2019-09-03 20:36:53,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:36:52" (2/3) ... [2019-09-03 20:36:53,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42854e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:36:53, skipping insertion in model container [2019-09-03 20:36:53,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:36:53" (3/3) ... [2019-09-03 20:36:53,017 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-09-03 20:36:53,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:36:53,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:36:53,051 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:36:53,078 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:36:53,078 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:36:53,079 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:36:53,079 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:36:53,079 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:36:53,079 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:36:53,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:36:53,079 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:36:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 20:36:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:53,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,105 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2019-09-03 20:36:53,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,212 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:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:53,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:36:53,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:53,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:36:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:36:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:53,236 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 20:36:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,251 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:36:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:36:53,252 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:36:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,260 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:36:53,260 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:36:53,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:36:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:36:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:36:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:36:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:36:53,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:36:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,293 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:36:53,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:36:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:36:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:36:53,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,295 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2019-09-03 20:36:53,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,346 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:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:36:53,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:53,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:36:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:36:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:53,351 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-03 20:36:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,391 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:36:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:36:53,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:36:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,393 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:36:53,393 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:36:53,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:36:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:36:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 20:36:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:36:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 20:36:53,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-03 20:36:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,399 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 20:36:53,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:36:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 20:36:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:36:53,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,400 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2019-09-03 20:36:53,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:36:53,436 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2019-09-03 20:36:53,480 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:36:53,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:36:53,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:36:53,626 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 2 different actions 12 times. Widened at 1 different actions 2 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 5. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-03 20:36:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:36:53,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:36:53,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 20:36:53,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:36:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:36:53,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:53,743 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-03 20:36:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,785 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-03 20:36:53,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:36:53,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:36:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:53,787 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:36:53,787 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:36:53,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:36:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:36:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 20:36:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:36:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:36:53,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 20:36:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:53,791 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:36:53,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:36:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:36:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:36:53,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:53,792 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:53,792 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2019-09-03 20:36:53,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:53,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:53,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:53,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:53,874 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,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:53,874 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,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:53,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:53,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:36:53,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:53,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:36:53,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:53,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:53,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-03 20:36:53,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:53,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:36:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:36:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:36:53,964 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-03 20:36:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:53,999 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:36:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:36:53,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 20:36:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,000 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:36:54,000 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:36:54,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:36:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:36:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:36:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:36:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:36:54,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 20:36:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,006 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:36:54,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:36:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:36:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:36:54,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,007 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,008 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2019-09-03 20:36:54,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,063 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:54,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,063 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:36:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:54,078 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:36:54,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:54,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-03 20:36:54,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:36:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:36:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,159 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-03 20:36:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,185 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:36:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:36:54,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 20:36:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,187 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:36:54,187 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:36:54,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:36:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 20:36:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:36:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:36:54,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 20:36:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,192 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:36:54,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:36:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:36:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:36:54,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,193 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,194 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,194 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2019-09-03 20:36:54,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,277 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:54,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,277 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:36:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,292 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:36:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-09-03 20:36:54,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:36:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:36:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,380 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-03 20:36:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,430 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:36:54,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:36:54,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-03 20:36:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,432 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:36:54,432 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:36:54,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:36:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 20:36:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:36:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:36:54,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 20:36:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,441 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:36:54,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:36:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:36:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:36:54,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,443 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,443 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2019-09-03 20:36:54,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,547 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:54,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,547 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:36:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:54,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:36:54,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:36:54,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-03 20:36:54,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:36:54,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:36:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,667 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-03 20:36:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:54,711 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:36:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:36:54,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 20:36:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:54,713 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:36:54,713 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:36:54,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:36:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:36:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:36:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:36:54,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 20:36:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:54,723 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:36:54,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:36:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:36:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:36:54,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:54,724 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:54,725 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2019-09-03 20:36:54,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:54,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:54,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:54,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:54,840 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:54,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:54,842 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:36:54,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:36:54,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:36:54,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:36:54,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:54,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:36:54,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:54,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:54,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2019-09-03 20:36:54,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:54,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:36:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:36:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:54,963 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-03 20:36:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,011 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:36:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:36:55,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 20:36:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,013 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:36:55,013 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:36:55,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:36:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 20:36:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:36:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:36:55,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 20:36:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,020 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:36:55,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:36:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:36:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:36:55,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,025 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,025 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2019-09-03 20:36:55,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:55,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:55,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:55,140 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:55,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,140 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:36:55,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:36:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:36:55,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:55,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-09-03 20:36:55,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:55,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:36:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:36:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:55,255 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-03 20:36:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,306 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 20:36:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:36:55,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 20:36:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,308 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:36:55,308 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:36:55,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:36:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:36:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:36:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:36:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:36:55,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 20:36:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,315 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:36:55,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:36:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:36:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:36:55,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,318 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,318 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2019-09-03 20:36:55,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:36:55,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:36:55,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:36:55,528 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:55,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:36:55,529 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:36:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:36:55,547 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:36:55,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:36:55,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:36:55,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:36:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:36:55,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:36:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:36:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:55,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:36:55,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:36:55,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:36:55,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:36:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:36:55,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:36:55,869 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-03 20:36:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:55,988 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:36:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:36:55,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-03 20:36:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:55,989 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:36:55,990 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:36:55,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:36:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:36:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 20:36:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:36:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:36:55,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 20:36:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:55,994 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:36:55,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:36:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:36:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:36:55,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:36:55,996 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:36:55,996 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:36:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:36:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2019-09-03 20:36:55,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:36:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:36:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:36:55,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:36:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:36:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:36:56,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:36:56,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-03 20:36:56,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:36:56,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:36:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:36:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:56,083 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-09-03 20:36:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:36:56,126 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-09-03 20:36:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:36:56,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-03 20:36:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:36:56,128 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:36:56,128 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:36:56,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:36:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:36:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:36:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:36:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:36:56,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-09-03 20:36:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:36:56,129 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:36:56,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:36:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:36:56,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:36:56,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:36:56 BoogieIcfgContainer [2019-09-03 20:36:56,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:36:56,138 INFO L168 Benchmark]: Toolchain (without parser) took 3707.89 ms. Allocated memory was 140.0 MB in the beginning and 254.3 MB in the end (delta: 114.3 MB). Free memory was 89.6 MB in the beginning and 136.9 MB in the end (delta: -47.3 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,139 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.49 ms. Allocated memory is still 140.0 MB. Free memory was 89.2 MB in the beginning and 80.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,140 INFO L168 Benchmark]: Boogie Preprocessor took 121.60 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 80.1 MB in the beginning and 179.4 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,141 INFO L168 Benchmark]: RCFGBuilder took 207.17 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 168.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,142 INFO L168 Benchmark]: TraceAbstraction took 3125.78 ms. Allocated memory was 201.3 MB in the beginning and 254.3 MB in the end (delta: 53.0 MB). Free memory was 168.1 MB in the beginning and 136.9 MB in the end (delta: 31.3 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:36:56,146 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.23 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.49 ms. Allocated memory is still 140.0 MB. Free memory was 89.2 MB in the beginning and 80.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.60 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 80.1 MB in the beginning and 179.4 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 207.17 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 168.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3125.78 ms. Allocated memory was 201.3 MB in the beginning and 254.3 MB in the end (delta: 53.0 MB). Free memory was 168.1 MB in the beginning and 136.9 MB in the end (delta: 31.3 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 38 SDslu, 452 SDs, 0 SdLazy, 276 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 271 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 352 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 26455 SizeOfPredicates, 8 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 27 InterpolantComputations, 3 PerfectInterpolantSequences, 81/693 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...