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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:29:19,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:29:19,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:29:19,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:29:19,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:29:19,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:29:19,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:29:19,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:29:19,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:29:19,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:29:19,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:29:19,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:29:19,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:29:19,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:29:19,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:29:19,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:29:19,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:29:19,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:29:19,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:29:19,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:29:19,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:29:19,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:29:19,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:29:19,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:29:19,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:29:19,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:29:19,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:29:19,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:29:19,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:29:19,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:29:19,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:29:19,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:29:19,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:29:19,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:29:19,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:29:19,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:29:19,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:29:19,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:29:19,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:29:19,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:29:19,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:29:19,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:29:19,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:29:19,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:29:19,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:29:19,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:29:19,570 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:29:19,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:29:19,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:29:19,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:29:19,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:29:19,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:29:19,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:29:19,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:29:19,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:29:19,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:29:19,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:29:19,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:29:19,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:29:19,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:29:19,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:29:19,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:29:19,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:29:19,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:29:19,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:29:19,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:29:19,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:29:19,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:29:19,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:29:19,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:29:19,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:29:19,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:29:19,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:29:19,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:29:19,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:29:19,642 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:29:19,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2019-10-02 11:29:19,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609cba8cc/6cf6479b5e2f470190b2728b5fbb0280/FLAGd5a681a40 [2019-10-02 11:29:20,190 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:29:20,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-10-02 11:29:20,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609cba8cc/6cf6479b5e2f470190b2728b5fbb0280/FLAGd5a681a40 [2019-10-02 11:29:20,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609cba8cc/6cf6479b5e2f470190b2728b5fbb0280 [2019-10-02 11:29:20,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:29:20,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:29:20,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:29:20,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:29:20,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:29:20,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:20,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0511c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20, skipping insertion in model container [2019-10-02 11:29:20,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:20,615 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:29:20,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:29:20,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:29:20,857 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:29:20,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:29:20,894 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:29:20,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20 WrapperNode [2019-10-02 11:29:20,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:29:20,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:29:20,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:29:20,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:29:21,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (1/1) ... [2019-10-02 11:29:21,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:29:21,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:29:21,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:29:21,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:29:21,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (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-10-02 11:29:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:29:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:29:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:29:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:29:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:29:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:29:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:29:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:29:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:29:21,280 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:29:21,280 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:29:21,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:29:21 BoogieIcfgContainer [2019-10-02 11:29:21,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:29:21,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:29:21,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:29:21,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:29:21,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:29:20" (1/3) ... [2019-10-02 11:29:21,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c3d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:29:21, skipping insertion in model container [2019-10-02 11:29:21,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:29:20" (2/3) ... [2019-10-02 11:29:21,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c3d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:29:21, skipping insertion in model container [2019-10-02 11:29:21,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:29:21" (3/3) ... [2019-10-02 11:29:21,289 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-10-02 11:29:21,300 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:29:21,308 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:29:21,325 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:29:21,356 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:29:21,357 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:29:21,357 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:29:21,357 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:29:21,357 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:29:21,358 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:29:21,358 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:29:21,358 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:29:21,358 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:29:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-02 11:29:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:29:21,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:21,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:21,386 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2019-10-02 11:29:21,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:21,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:21,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:21,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:21,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:29:21,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:29:21,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:29:21,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:29:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:29:21,519 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-02 11:29:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:21,540 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-02 11:29:21,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:29:21,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-02 11:29:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:21,548 INFO L225 Difference]: With dead ends: 29 [2019-10-02 11:29:21,548 INFO L226 Difference]: Without dead ends: 12 [2019-10-02 11:29:21,552 INFO L640 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-10-02 11:29:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-02 11:29:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-02 11:29:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-02 11:29:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-02 11:29:21,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-02 11:29:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:21,591 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-02 11:29:21,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:29:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-02 11:29:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:29:21,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:21,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:21,593 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2019-10-02 11:29:21,594 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:21,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:29:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:29:21,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:29:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:29:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:29:21,665 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-10-02 11:29:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:21,701 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-10-02 11:29:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:29:21,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-02 11:29:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:21,704 INFO L225 Difference]: With dead ends: 19 [2019-10-02 11:29:21,704 INFO L226 Difference]: Without dead ends: 14 [2019-10-02 11:29:21,706 INFO L640 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-10-02 11:29:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-02 11:29:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-02 11:29:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-02 11:29:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-10-02 11:29:21,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-10-02 11:29:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:21,716 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-10-02 11:29:21,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:29:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-10-02 11:29:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:29:21,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:21,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:21,718 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2019-10-02 11:29:21,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:21,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:21,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:21,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:29:21,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:21,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 11:29:21,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:29:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:29:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:29:21,865 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-10-02 11:29:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:21,897 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-10-02 11:29:21,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:29:21,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:29:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:21,899 INFO L225 Difference]: With dead ends: 21 [2019-10-02 11:29:21,899 INFO L226 Difference]: Without dead ends: 16 [2019-10-02 11:29:21,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:29:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-02 11:29:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-02 11:29:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-02 11:29:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-02 11:29:21,905 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-10-02 11:29:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:21,905 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-02 11:29:21,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:29:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-02 11:29:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:29:21,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:21,906 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:21,907 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2019-10-02 11:29:21,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:21,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:21,978 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:29:22,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:29:22,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:22,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:29:22,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:29:22,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:22,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 11:29:22,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:29:22,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:29:22,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:29:22,033 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-10-02 11:29:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:22,069 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-10-02 11:29:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:29:22,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-02 11:29:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:22,071 INFO L225 Difference]: With dead ends: 23 [2019-10-02 11:29:22,071 INFO L226 Difference]: Without dead ends: 18 [2019-10-02 11:29:22,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:29:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-02 11:29:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-02 11:29:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-02 11:29:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-10-02 11:29:22,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-10-02 11:29:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:22,077 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-10-02 11:29:22,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:29:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-10-02 11:29:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:29:22,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:22,079 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:22,079 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2019-10-02 11:29:22,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:22,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:22,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:22,163 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:22,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:29:22,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 11:29:22,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:29:22,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:22,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 11:29:22,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:29:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:29:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:29:22,212 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-10-02 11:29:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:22,276 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-10-02 11:29:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:29:22,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-02 11:29:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:22,278 INFO L225 Difference]: With dead ends: 25 [2019-10-02 11:29:22,278 INFO L226 Difference]: Without dead ends: 20 [2019-10-02 11:29:22,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-10-02 11:29:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-02 11:29:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-02 11:29:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-02 11:29:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-10-02 11:29:22,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-10-02 11:29:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:22,290 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-10-02 11:29:22,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:29:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-10-02 11:29:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:29:22,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:22,292 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:22,292 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2019-10-02 11:29:22,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:22,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:22,385 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:22,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:29:22,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:29:22,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:22,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 11:29:22,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:29:22,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:29:22,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:29:22,437 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-10-02 11:29:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:22,500 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-10-02 11:29:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:29:22,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-02 11:29:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:22,503 INFO L225 Difference]: With dead ends: 27 [2019-10-02 11:29:22,503 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:29:22,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:29:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:29:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-02 11:29:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:29:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-02 11:29:22,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-10-02 11:29:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:22,517 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-02 11:29:22,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:29:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-02 11:29:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:29:22,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:22,520 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:22,520 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2019-10-02 11:29:22,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:22,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:22,633 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:29:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:22,699 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 11:29:22,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:22,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:29:22,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-02 11:29:22,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:29:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:29:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:29:22,730 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-10-02 11:29:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:22,785 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-10-02 11:29:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:29:22,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-02 11:29:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:22,786 INFO L225 Difference]: With dead ends: 29 [2019-10-02 11:29:22,786 INFO L226 Difference]: Without dead ends: 24 [2019-10-02 11:29:22,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 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-10-02 11:29:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-02 11:29:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-02 11:29:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 11:29:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-10-02 11:29:22,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-10-02 11:29:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:22,797 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-10-02 11:29:22,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:29:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-10-02 11:29:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:29:22,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:22,798 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:22,800 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2019-10-02 11:29:22,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:22,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:22,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:22,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:22,929 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:22,955 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:29:22,970 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 11:29:22,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:22,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:29:22,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:23,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-10-02 11:29:23,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:29:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:29:23,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:29:23,004 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-10-02 11:29:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,044 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-10-02 11:29:23,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:29:23,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-02 11:29:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,046 INFO L225 Difference]: With dead ends: 31 [2019-10-02 11:29:23,046 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 11:29:23,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:29:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 11:29:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-02 11:29:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 11:29:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-10-02 11:29:23,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-10-02 11:29:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,052 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-10-02 11:29:23,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:29:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-10-02 11:29:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:29:23,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,053 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:23,053 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2019-10-02 11:29:23,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:23,173 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:29:23,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:29:23,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:23,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-02 11:29:23,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:29:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:29:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:29:23,246 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-10-02 11:29:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,305 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-10-02 11:29:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:29:23,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-02 11:29:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,310 INFO L225 Difference]: With dead ends: 32 [2019-10-02 11:29:23,310 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 11:29:23,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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-10-02 11:29:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 11:29:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 11:29:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:29:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-10-02 11:29:23,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-10-02 11:29:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,323 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-10-02 11:29:23,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:29:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-10-02 11:29:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:29:23,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,324 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:23,324 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2019-10-02 11:29:23,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:29:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:23,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:29:23,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:29:23,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:29:23,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:23,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:29:23,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:23,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-10-02 11:29:23,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:29:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:29:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:29:23,637 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-10-02 11:29:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,754 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-10-02 11:29:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:29:23,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-10-02 11:29:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,755 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:29:23,755 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 11:29:23,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:29:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 11:29:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-02 11:29:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:29:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-10-02 11:29:23,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-10-02 11:29:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,766 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-10-02 11:29:23,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:29:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-10-02 11:29:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:29:23,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,767 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:23,768 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2019-10-02 11:29:23,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:29:23,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:29:23,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:29:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:29:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:29:23,913 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-10-02 11:29:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,957 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-10-02 11:29:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:29:23,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-10-02 11:29:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,958 INFO L225 Difference]: With dead ends: 29 [2019-10-02 11:29:23,958 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:29:23,959 INFO L640 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-10-02 11:29:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:29:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:29:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:29:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:29:23,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-10-02 11:29:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,960 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:29:23,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:29:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:29:23,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:29:23,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:29:24,091 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:29:24,091 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:29:24,091 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:29:24,091 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:29:24,092 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:29:24,092 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:29:24,092 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2019-10-02 11:29:24,092 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2019-10-02 11:29:24,092 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2019-10-02 11:29:24,092 INFO L443 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-10-02 11:29:24,092 INFO L439 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6) (<= main_~sn~0 10)) (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 7 main_~i~0) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= main_~i~0 7)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0))) [2019-10-02 11:29:24,093 INFO L439 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2019-10-02 11:29:24,093 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-02 11:29:24,093 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:29:24,093 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-02 11:29:24,093 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-02 11:29:24,093 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-02 11:29:24,093 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:29:24,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:29:24 BoogieIcfgContainer [2019-10-02 11:29:24,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:29:24,113 INFO L168 Benchmark]: Toolchain (without parser) took 3515.30 ms. Allocated memory was 133.7 MB in the beginning and 257.9 MB in the end (delta: 124.3 MB). Free memory was 89.2 MB in the beginning and 208.8 MB in the end (delta: -119.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,114 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.23 ms. Allocated memory is still 133.7 MB. Free memory was 89.0 MB in the beginning and 79.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,116 INFO L168 Benchmark]: Boogie Preprocessor took 135.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 79.7 MB in the beginning and 177.8 MB in the end (delta: -98.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,117 INFO L168 Benchmark]: RCFGBuilder took 249.87 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 166.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,119 INFO L168 Benchmark]: TraceAbstraction took 2828.36 ms. Allocated memory was 200.8 MB in the beginning and 257.9 MB in the end (delta: 57.1 MB). Free memory was 165.8 MB in the beginning and 208.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:29:24,123 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.20 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.23 ms. Allocated memory is still 133.7 MB. Free memory was 89.0 MB in the beginning and 79.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 79.7 MB in the beginning and 177.8 MB in the end (delta: -98.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 249.87 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 166.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2828.36 ms. Allocated memory was 200.8 MB in the beginning and 257.9 MB in the end (delta: 57.1 MB). Free memory was 165.8 MB in the beginning and 208.8 MB in the end (delta: -43.0 MB). Peak memory consumption was 14.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 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((10 <= sn && 6 <= i) && i <= 6) && sn <= 10) || (((1 <= i && i <= 1) && sn <= 0) && 0 <= sn)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((7 <= i && 12 <= sn) && sn <= 12) && i <= 7)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 38 SDslu, 400 SDs, 0 SdLazy, 269 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s 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.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17729 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...