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-fea9116 [2019-09-20 13:25:11,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:11,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:11,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:11,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:11,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:11,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:11,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:11,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:11,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:11,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:11,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:11,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:11,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:11,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:11,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:11,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:11,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:11,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:11,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:11,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:11,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:11,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:11,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:11,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:11,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:11,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:11,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:11,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:11,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:11,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:11,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:11,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:11,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:11,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:11,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:11,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:11,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:11,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:11,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:11,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:11,349 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-20 13:25:11,364 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:11,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:11,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:11,365 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:11,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:11,365 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:11,366 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:11,366 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:11,366 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:11,366 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:11,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:11,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:11,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:11,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:11,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:11,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:11,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:11,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:11,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:11,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:11,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:11,369 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:11,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:11,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:11,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:11,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:11,371 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:11,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:11,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:11,371 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:11,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:11,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:11,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:11,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:11,442 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:11,444 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-20 13:25:11,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8716543a6/8364b8f524f34f1db201425149ec9c7c/FLAG7c58a15f4 [2019-09-20 13:25:11,909 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:11,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-09-20 13:25:11,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8716543a6/8364b8f524f34f1db201425149ec9c7c/FLAG7c58a15f4 [2019-09-20 13:25:12,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8716543a6/8364b8f524f34f1db201425149ec9c7c [2019-09-20 13:25:12,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:12,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:12,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:12,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:12,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:12,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0ed8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12, skipping insertion in model container [2019-09-20 13:25:12,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,350 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:12,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:12,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:12,560 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:12,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:12,584 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:12,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12 WrapperNode [2019-09-20 13:25:12,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:12,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:12,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:12,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:12,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (1/1) ... [2019-09-20 13:25:12,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:12,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:12,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:12,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:12,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (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-20 13:25:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 13:25:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:12,925 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:12,926 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:25:12,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:12 BoogieIcfgContainer [2019-09-20 13:25:12,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:12,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:12,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:12,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:12,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:12" (1/3) ... [2019-09-20 13:25:12,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3ccb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:12, skipping insertion in model container [2019-09-20 13:25:12,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:12" (2/3) ... [2019-09-20 13:25:12,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3ccb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:12, skipping insertion in model container [2019-09-20 13:25:12,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:12" (3/3) ... [2019-09-20 13:25:12,935 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-09-20 13:25:12,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:12,951 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:25:12,968 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:25:12,994 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:12,994 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:12,994 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:12,994 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:12,994 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:12,995 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:12,995 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:12,995 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-20 13:25:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:25:13,016 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,016 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:13,018 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2019-09-20 13:25:13,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,113 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-20 13:25:13,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:13,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:25:13,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:13,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:25:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:25:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:25:13,131 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-20 13:25:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,146 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-20 13:25:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:25:13,148 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 13:25:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,157 INFO L225 Difference]: With dead ends: 18 [2019-09-20 13:25:13,157 INFO L226 Difference]: Without dead ends: 12 [2019-09-20 13:25:13,159 INFO L636 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-20 13:25:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-20 13:25:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-20 13:25:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-20 13:25:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-20 13:25:13,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-20 13:25:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,196 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-20 13:25:13,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:25:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-20 13:25:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:25:13,197 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,197 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:13,197 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2019-09-20 13:25:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,254 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-20 13:25:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:13,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:13,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:13,257 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-20 13:25:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,325 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-20 13:25:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:13,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-20 13:25:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,327 INFO L225 Difference]: With dead ends: 14 [2019-09-20 13:25:13,327 INFO L226 Difference]: Without dead ends: 14 [2019-09-20 13:25:13,328 INFO L636 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-20 13:25:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-20 13:25:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-20 13:25:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-20 13:25:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-20 13:25:13,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-20 13:25:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,332 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-20 13:25:13,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-20 13:25:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:13,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,333 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:13,334 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2019-09-20 13:25:13,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,444 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-20 13:25:13,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:13,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:13,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-20 13:25:13,447 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2019-09-20 13:25:13,473 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:13,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:13,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:13,587 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-20 13:25:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:13,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:13,591 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-20 13:25:13,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:25:13,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:13,665 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-20 13:25:13,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:13,716 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-20 13:25:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-20 13:25:13,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:13,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:13,723 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-20 13:25:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,750 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-20 13:25:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:13,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:25:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,752 INFO L225 Difference]: With dead ends: 16 [2019-09-20 13:25:13,752 INFO L226 Difference]: Without dead ends: 16 [2019-09-20 13:25:13,753 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-20 13:25:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-20 13:25:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-20 13:25:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-20 13:25:13,757 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-20 13:25:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,757 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-20 13:25:13,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-20 13:25:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:13,758 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,758 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:13,758 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2019-09-20 13:25:13,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:13,806 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-20 13:25:13,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:13,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:13,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:13,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:13,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:13,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:13,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:13,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:13,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 13:25:13,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:13,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:25:13,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:13,851 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-20 13:25:13,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:13,886 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-20 13:25:13,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:13,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-20 13:25:13,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:13,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:13,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:25:13,891 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-20 13:25:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:13,923 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-20 13:25:13,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:13,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 13:25:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:13,924 INFO L225 Difference]: With dead ends: 18 [2019-09-20 13:25:13,925 INFO L226 Difference]: Without dead ends: 18 [2019-09-20 13:25:13,927 INFO L636 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-20 13:25:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-20 13:25:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-20 13:25:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-20 13:25:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-20 13:25:13,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-20 13:25:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:13,933 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-20 13:25:13,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-20 13:25:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:13,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:13,934 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:13,935 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2019-09-20 13:25:13,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:13,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:13,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:13,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,054 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-20 13:25:14,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:14,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:14,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:14,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:14,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:14,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:14,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:14,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:25:14,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:14,116 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-20 13:25:14,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:14,179 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-20 13:25:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:14,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-20 13:25:14,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:14,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,185 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-20 13:25:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:14,220 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-20 13:25:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:14,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-20 13:25:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:14,222 INFO L225 Difference]: With dead ends: 20 [2019-09-20 13:25:14,223 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 13:25:14,223 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 13:25:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-20 13:25:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-20 13:25:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-20 13:25:14,230 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-20 13:25:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:14,231 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-20 13:25:14,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-20 13:25:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:14,232 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:14,237 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:14,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2019-09-20 13:25:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:14,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,328 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-20 13:25:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:14,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:14,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:14,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:14,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:14,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:25:14,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:14,366 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-20 13:25:14,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:14,429 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-20 13:25:14,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:14,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-09-20 13:25:14,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:14,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:14,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,438 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-20 13:25:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:14,476 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-20 13:25:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:25:14,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-20 13:25:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:14,477 INFO L225 Difference]: With dead ends: 22 [2019-09-20 13:25:14,477 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 13:25:14,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 13:25:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-20 13:25:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 13:25:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-20 13:25:14,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-20 13:25:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:14,481 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-20 13:25:14,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-20 13:25:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:25:14,482 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:14,482 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:14,483 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2019-09-20 13:25:14,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,549 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-20 13:25:14,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:14,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:14,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:14,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,550 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-20 13:25:14,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:14,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:25:14,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-20 13:25:14,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:14,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 13:25:14,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:14,597 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-20 13:25:14,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:14,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-20 13:25:14,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:14,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-20 13:25:14,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:14,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:25:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:25:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,668 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-20 13:25:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:14,717 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-20 13:25:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:14,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-20 13:25:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:14,719 INFO L225 Difference]: With dead ends: 24 [2019-09-20 13:25:14,720 INFO L226 Difference]: Without dead ends: 24 [2019-09-20 13:25:14,720 INFO L636 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-20 13:25:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-20 13:25:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-20 13:25:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:25:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-20 13:25:14,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-20 13:25:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:14,726 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-20 13:25:14,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:25:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-20 13:25:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:25:14,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:14,728 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:14,728 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:14,729 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2019-09-20 13:25:14,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:14,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:14,836 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-20 13:25:14,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:14,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:14,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:14,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:14,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:14,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:14,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:14,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:14,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:14,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:25:14,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:14,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-20 13:25:14,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:14,960 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-20 13:25:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2019-09-20 13:25:14,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:14,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:25:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:25:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:14,966 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-20 13:25:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:15,001 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-20 13:25:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:25:15,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-20 13:25:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:15,003 INFO L225 Difference]: With dead ends: 26 [2019-09-20 13:25:15,003 INFO L226 Difference]: Without dead ends: 26 [2019-09-20 13:25:15,003 INFO L636 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-20 13:25:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-20 13:25:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-20 13:25:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 13:25:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-20 13:25:15,008 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-20 13:25:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:15,008 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-20 13:25:15,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:25:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-20 13:25:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:25:15,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:15,009 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:15,010 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2019-09-20 13:25:15,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:15,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:15,106 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-20 13:25:15,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:15,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:15,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:15,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:15,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:15,107 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) [2019-09-20 13:25:15,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:15,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:15,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:25:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:15,145 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-20 13:25:15,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:15,219 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-20 13:25:15,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:15,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-09-20 13:25:15,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:15,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:25:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:25:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:15,225 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-20 13:25:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:15,260 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-20 13:25:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:25:15,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-20 13:25:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:15,261 INFO L225 Difference]: With dead ends: 27 [2019-09-20 13:25:15,262 INFO L226 Difference]: Without dead ends: 27 [2019-09-20 13:25:15,262 INFO L636 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-20 13:25:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-20 13:25:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-20 13:25:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 13:25:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-20 13:25:15,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-20 13:25:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:15,269 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-20 13:25:15,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:25:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-20 13:25:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:25:15,270 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:15,271 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:15,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2019-09-20 13:25:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:15,486 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-20 13:25:15,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:15,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:15,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:15,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:15,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:15,487 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-20 13:25:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:15,509 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-20 13:25:15,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-20 13:25:15,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:15,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-20 13:25:15,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:15,611 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-20 13:25:15,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:25:15,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:15,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-20 13:25:15,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:15,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:25:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:25:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:25:15,818 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-20 13:25:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:15,921 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-20 13:25:15,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:25:15,922 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-20 13:25:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:15,923 INFO L225 Difference]: With dead ends: 32 [2019-09-20 13:25:15,923 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 13:25:15,923 INFO L636 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-20 13:25:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 13:25:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-20 13:25:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 13:25:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-20 13:25:15,927 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-20 13:25:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:15,927 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-20 13:25:15,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:25:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-20 13:25:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:25:15,928 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:15,928 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:15,928 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2019-09-20 13:25:15,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:15,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:16,003 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-20 13:25:16,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:16,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:25:16,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:16,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:25:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:25:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:25:16,005 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-09-20 13:25:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:16,036 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-09-20 13:25:16,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:25:16,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-20 13:25:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:16,037 INFO L225 Difference]: With dead ends: 22 [2019-09-20 13:25:16,038 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:25:16,038 INFO L636 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-20 13:25:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:25:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:25:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:25:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:25:16,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-09-20 13:25:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:16,039 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:25:16,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:25:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:25:16,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:25:16,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:25:16 BoogieIcfgContainer [2019-09-20 13:25:16,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:25:16,047 INFO L168 Benchmark]: Toolchain (without parser) took 3711.64 ms. Allocated memory was 135.8 MB in the beginning and 257.9 MB in the end (delta: 122.2 MB). Free memory was 87.0 MB in the beginning and 129.4 MB in the end (delta: -42.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:16,047 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:25:16,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.12 ms. Allocated memory is still 135.8 MB. Free memory was 87.0 MB in the beginning and 77.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:16,049 INFO L168 Benchmark]: Boogie Preprocessor took 123.23 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 77.8 MB in the beginning and 177.8 MB in the end (delta: -100.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:16,050 INFO L168 Benchmark]: RCFGBuilder took 217.79 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 167.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:16,051 INFO L168 Benchmark]: TraceAbstraction took 3116.33 ms. Allocated memory was 200.3 MB in the beginning and 257.9 MB in the end (delta: 57.7 MB). Free memory was 167.2 MB in the beginning and 129.4 MB in the end (delta: 37.8 MB). Peak memory consumption was 95.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:16,054 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.18 ms. Allocated memory is still 135.8 MB. Free memory is still 105.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.12 ms. Allocated memory is still 135.8 MB. Free memory was 87.0 MB in the beginning and 77.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.23 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 77.8 MB in the beginning and 177.8 MB in the end (delta: -100.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 217.79 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 167.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3116.33 ms. Allocated memory was 200.3 MB in the beginning and 257.9 MB in the end (delta: 57.7 MB). Free memory was 167.2 MB in the beginning and 129.4 MB in the end (delta: 37.8 MB). Peak memory consumption was 95.5 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.1s 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...