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/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:13:22,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:13:22,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:13:22,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:13:22,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:13:22,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:13:22,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:13:22,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:13:22,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:13:22,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:13:22,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:13:22,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:13:22,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:13:22,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:13:22,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:13:22,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:13:22,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:13:22,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:13:22,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:13:22,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:13:22,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:13:22,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:13:22,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:13:22,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:13:22,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:13:22,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:13:22,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:13:22,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:13:22,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:13:22,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:13:22,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:13:22,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:13:22,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:13:22,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:13:22,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:13:22,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:13:22,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:13:22,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:13:22,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:13:22,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:13:22,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:13:22,151 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:13:22,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:13:22,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:13:22,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:13:22,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:13:22,170 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:13:22,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:13:22,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:13:22,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:13:22,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:13:22,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:13:22,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:13:22,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:13:22,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:13:22,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:13:22,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:13:22,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:13:22,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:13:22,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:13:22,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:13:22,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:13:22,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:13:22,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:13:22,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:13:22,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:13:22,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:13:22,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:13:22,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:13:22,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:13:22,245 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:13:22,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-02 11:13:22,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3f3aab4/fe8956480e5f4dfdadecb1c4d5b90f8b/FLAG8dca065d9 [2019-10-02 11:13:22,798 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:13:22,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-02 11:13:22,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3f3aab4/fe8956480e5f4dfdadecb1c4d5b90f8b/FLAG8dca065d9 [2019-10-02 11:13:23,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3f3aab4/fe8956480e5f4dfdadecb1c4d5b90f8b [2019-10-02 11:13:23,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:13:23,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:13:23,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:13:23,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:13:23,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:13:23,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b840ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23, skipping insertion in model container [2019-10-02 11:13:23,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:13:23,281 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:13:23,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:13:23,499 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:13:23,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:13:23,528 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:13:23,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23 WrapperNode [2019-10-02 11:13:23,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:13:23,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:13:23,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:13:23,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:13:23,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (1/1) ... [2019-10-02 11:13:23,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:13:23,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:13:23,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:13:23,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:13:23,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (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:13:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:13:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:13:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:13:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:13:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:13:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:13:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:13:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:13:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:13:23,872 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:13:23,872 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:13:23,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:13:23 BoogieIcfgContainer [2019-10-02 11:13:23,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:13:23,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:13:23,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:13:23,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:13:23,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:13:23" (1/3) ... [2019-10-02 11:13:23,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:13:23, skipping insertion in model container [2019-10-02 11:13:23,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:13:23" (2/3) ... [2019-10-02 11:13:23,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:13:23, skipping insertion in model container [2019-10-02 11:13:23,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:13:23" (3/3) ... [2019-10-02 11:13:23,881 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-10-02 11:13:23,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:13:23,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:13:23,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:13:23,943 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:13:23,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:13:23,944 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:13:23,944 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:13:23,945 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:13:23,945 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:13:23,945 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:13:23,945 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:13:23,945 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:13:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-02 11:13:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:13:23,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:23,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:23,967 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-10-02 11:13:23,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:24,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:24,178 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:13:24,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:13:24,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:13:24,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:13:24,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:13:24,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:13:24,204 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-02 11:13:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:24,253 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-10-02 11:13:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:13:24,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-02 11:13:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:24,266 INFO L225 Difference]: With dead ends: 36 [2019-10-02 11:13:24,266 INFO L226 Difference]: Without dead ends: 16 [2019-10-02 11:13:24,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:13:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-02 11:13:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-02 11:13:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-02 11:13:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-02 11:13:24,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-10-02 11:13:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:24,318 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-02 11:13:24,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:13:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-02 11:13:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:13:24,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:24,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:24,323 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-10-02 11:13:24,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:13:24,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:13:24,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:13:24,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:13:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:13:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:13:24,418 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-10-02 11:13:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:24,440 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-10-02 11:13:24,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:13:24,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 11:13:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:24,441 INFO L225 Difference]: With dead ends: 23 [2019-10-02 11:13:24,441 INFO L226 Difference]: Without dead ends: 15 [2019-10-02 11:13:24,443 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:13:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-02 11:13:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-02 11:13:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-02 11:13:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-02 11:13:24,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-10-02 11:13:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:24,448 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-02 11:13:24,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:13:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-02 11:13:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:13:24,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:24,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:24,450 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-10-02 11:13:24,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:24,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:13:24,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:24,535 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:13:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:24,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:13:24,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:13:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:24,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-02 11:13:24,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:13:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:13:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:13:24,639 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-10-02 11:13:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:24,760 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-02 11:13:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:13:24,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-02 11:13:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:24,761 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:13:24,762 INFO L226 Difference]: Without dead ends: 25 [2019-10-02 11:13:24,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:13:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-02 11:13:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-10-02 11:13:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:13:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-02 11:13:24,769 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-02 11:13:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:24,769 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-02 11:13:24,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:13:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-02 11:13:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:13:24,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:24,771 INFO L411 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:24,771 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-10-02 11:13:24,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:24,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:24,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:24,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:13:24,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:24,868 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) [2019-10-02 11:13:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:13:24,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:13:24,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:24,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:13:24,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:13:24,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:24,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 11:13:24,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:13:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:13:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:13:24,964 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2019-10-02 11:13:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:25,228 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-02 11:13:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:13:25,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-02 11:13:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:25,230 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:13:25,230 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:13:25,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:13:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:13:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-10-02 11:13:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:13:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-02 11:13:25,250 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-10-02 11:13:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:25,251 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-02 11:13:25,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:13:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-02 11:13:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:13:25,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:25,254 INFO L411 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:25,255 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-10-02 11:13:25,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:25,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:25,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:25,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:13:25,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:25,404 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:13:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:13:25,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 11:13:25,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:25,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:13:25,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:13:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:25,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 11:13:25,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:13:25,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:13:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:13:25,500 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2019-10-02 11:13:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:25,556 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-10-02 11:13:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:13:25,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-02 11:13:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:25,558 INFO L225 Difference]: With dead ends: 51 [2019-10-02 11:13:25,558 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 11:13:25,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:13:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 11:13:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-02 11:13:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 11:13:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-02 11:13:25,572 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2019-10-02 11:13:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:25,572 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-02 11:13:25,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:13:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-02 11:13:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:13:25,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:25,574 INFO L411 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:25,575 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1418818136, now seen corresponding path program 4 times [2019-10-02 11:13:25,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:25,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:25,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:13:25,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:25,755 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:13:25,773 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:13:25,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:13:25,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:25,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:13:25,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:13:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:25,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-10-02 11:13:25,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:13:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:13:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:13:25,926 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 15 states. [2019-10-02 11:13:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:26,395 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-10-02 11:13:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:13:26,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-10-02 11:13:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:26,397 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:13:26,398 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 11:13:26,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:13:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 11:13:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-10-02 11:13:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:13:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 11:13:26,407 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 31 [2019-10-02 11:13:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:26,408 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 11:13:26,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:13:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 11:13:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 11:13:26,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:26,409 INFO L411 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:26,409 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1949427083, now seen corresponding path program 5 times [2019-10-02 11:13:26,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:26,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-02 11:13:26,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:26,537 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:13:26,563 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:13:26,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-02 11:13:26,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:26,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:13:26,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 11:13:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 11:13:26,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:13:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:13:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:13:26,658 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2019-10-02 11:13:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:26,715 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-10-02 11:13:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:13:26,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-02 11:13:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:26,717 INFO L225 Difference]: With dead ends: 78 [2019-10-02 11:13:26,717 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 11:13:26,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:13:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 11:13:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-02 11:13:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:13:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-02 11:13:26,734 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 42 [2019-10-02 11:13:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:26,734 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-02 11:13:26,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:13:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-02 11:13:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:13:26,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:26,740 INFO L411 BasicCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:26,741 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -649475471, now seen corresponding path program 6 times [2019-10-02 11:13:26,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:26,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:26,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:26,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-02 11:13:26,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:26,925 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) [2019-10-02 11:13:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:13:27,028 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 11:13:27,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:27,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:13:27,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 254 proven. 21 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:13:27,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:27,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 11:13:27,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:13:27,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:13:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:13:27,070 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2019-10-02 11:13:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:27,142 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2019-10-02 11:13:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:13:27,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-10-02 11:13:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:27,143 INFO L225 Difference]: With dead ends: 85 [2019-10-02 11:13:27,143 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:13:27,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:13:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:13:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-02 11:13:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 11:13:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-02 11:13:27,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 46 [2019-10-02 11:13:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-02 11:13:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:13:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-02 11:13:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:13:27,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:27,155 INFO L411 BasicCegarLoop]: trace histogram [28, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:27,155 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1892649995, now seen corresponding path program 7 times [2019-10-02 11:13:27,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:27,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-02 11:13:27,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:27,332 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:13:27,361 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:13:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:27,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:13:27,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 11:13:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:27,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-10-02 11:13:27,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:13:27,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:13:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:13:27,591 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2019-10-02 11:13:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:28,497 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-10-02 11:13:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 11:13:28,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-10-02 11:13:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:28,499 INFO L225 Difference]: With dead ends: 113 [2019-10-02 11:13:28,499 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 11:13:28,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=2706, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:13:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 11:13:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-10-02 11:13:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 11:13:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-02 11:13:28,526 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 50 [2019-10-02 11:13:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:28,527 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-02 11:13:28,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:13:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-02 11:13:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:13:28,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:28,528 INFO L411 BasicCegarLoop]: trace histogram [40, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:28,528 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1564944312, now seen corresponding path program 8 times [2019-10-02 11:13:28,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:28,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:13:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-10-02 11:13:28,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:28,680 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) [2019-10-02 11:13:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:13:28,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:13:28,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:28,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:13:28,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 11:13:28,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:28,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2019-10-02 11:13:28,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:13:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:13:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:13:28,961 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 23 states. [2019-10-02 11:13:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:30,432 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2019-10-02 11:13:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-02 11:13:30,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-10-02 11:13:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:30,434 INFO L225 Difference]: With dead ends: 145 [2019-10-02 11:13:30,435 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 11:13:30,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=4619, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 11:13:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 11:13:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2019-10-02 11:13:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 11:13:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-10-02 11:13:30,450 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 65 [2019-10-02 11:13:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:30,450 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-10-02 11:13:30,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:13:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-10-02 11:13:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:13:30,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:30,452 INFO L411 BasicCegarLoop]: trace histogram [54, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:30,452 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1497018839, now seen corresponding path program 9 times [2019-10-02 11:13:30,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:30,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:30,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:30,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-10-02 11:13:30,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:30,614 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:13:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:13:30,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 11:13:30,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:30,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:13:30,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 511 proven. 45 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-02 11:13:30,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:30,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-02 11:13:30,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:13:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:13:30,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:13:30,847 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 13 states. [2019-10-02 11:13:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:30,943 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2019-10-02 11:13:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:13:30,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-10-02 11:13:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:30,945 INFO L225 Difference]: With dead ends: 156 [2019-10-02 11:13:30,945 INFO L226 Difference]: Without dead ends: 89 [2019-10-02 11:13:30,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:13:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-02 11:13:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-02 11:13:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 11:13:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-10-02 11:13:30,976 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 82 [2019-10-02 11:13:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:30,977 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-10-02 11:13:30,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:13:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-10-02 11:13:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:13:30,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:30,982 INFO L411 BasicCegarLoop]: trace histogram [60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:30,982 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 642319569, now seen corresponding path program 10 times [2019-10-02 11:13:30,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:30,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:30,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:30,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1851 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-02 11:13:31,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:31,149 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:13:31,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:13:31,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:13:31,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:13:31,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:13:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:13:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:13:31,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:13:31,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2019-10-02 11:13:31,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:13:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:13:31,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:13:31,397 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 17 states. [2019-10-02 11:13:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:13:31,603 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-10-02 11:13:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:13:31,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-10-02 11:13:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:13:31,605 INFO L225 Difference]: With dead ends: 119 [2019-10-02 11:13:31,605 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 11:13:31,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:13:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 11:13:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-10-02 11:13:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-02 11:13:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-10-02 11:13:31,617 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 88 [2019-10-02 11:13:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:13:31,618 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-10-02 11:13:31,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:13:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-10-02 11:13:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:13:31,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:13:31,620 INFO L411 BasicCegarLoop]: trace histogram [70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:13:31,620 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:13:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:13:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -284489192, now seen corresponding path program 11 times [2019-10-02 11:13:31,621 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:13:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:13:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:31,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:13:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:13:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:13:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-02 11:13:31,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:13:31,835 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:13:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:14:40,777 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-02 11:14:40,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:40,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 11:14:40,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 0 proven. 2642 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-10-02 11:14:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 19 [2019-10-02 11:14:41,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:14:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:14:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:14:41,180 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 19 states. [2019-10-02 11:14:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:41,547 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2019-10-02 11:14:41,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:14:41,552 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-10-02 11:14:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:41,554 INFO L225 Difference]: With dead ends: 132 [2019-10-02 11:14:41,554 INFO L226 Difference]: Without dead ends: 127 [2019-10-02 11:14:41,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:14:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-02 11:14:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-10-02 11:14:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-02 11:14:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-10-02 11:14:41,574 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 101 [2019-10-02 11:14:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:41,575 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-10-02 11:14:41,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:14:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-10-02 11:14:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 11:14:41,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:41,576 INFO L411 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:41,577 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 12 times [2019-10-02 11:14:41,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:14:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-02 11:14:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:41,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:14:41,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:14:45,726 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 11:14:45,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:45,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:14:45,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:45,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:45,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:45,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:45,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:45,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:58,579 WARN L191 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-10-02 11:15:03,495 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-10-02 11:15:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 3030 trivial. 0 not checked. [2019-10-02 11:15:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:15:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 11:15:03,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:15:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:15:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=182, Unknown=4, NotChecked=0, Total=240 [2019-10-02 11:15:03,520 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 16 states. [2019-10-02 11:15:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:04,145 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-10-02 11:15:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:15:04,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2019-10-02 11:15:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:04,147 INFO L225 Difference]: With dead ends: 144 [2019-10-02 11:15:04,147 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:15:04,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=82, Invalid=256, Unknown=4, NotChecked=0, Total=342 [2019-10-02 11:15:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:15:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:15:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:15:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:15:04,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2019-10-02 11:15:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:04,150 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:15:04,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:15:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:15:04,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:15:04,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:15:04,469 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 56 [2019-10-02 11:15:04,585 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:15:04,585 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:15:04,585 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:15:04,585 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:15:04,586 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:15:04,586 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:15:04,586 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-10-02 11:15:04,586 INFO L439 ceAbstractionStarter]: At program point L17-2(lines 17 19) the Hoare annotation is: (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2019-10-02 11:15:04,586 INFO L443 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-10-02 11:15:04,586 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-10-02 11:15:04,586 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-10-02 11:15:04,587 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2019-10-02 11:15:04,587 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2019-10-02 11:15:04,587 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-02 11:15:04,587 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:15:04,587 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-02 11:15:04,587 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-02 11:15:04,588 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-02 11:15:04,588 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:15:04,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:15:04 BoogieIcfgContainer [2019-10-02 11:15:04,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:15:04,616 INFO L168 Benchmark]: Toolchain (without parser) took 101365.61 ms. Allocated memory was 142.1 MB in the beginning and 345.5 MB in the end (delta: 203.4 MB). Free memory was 88.9 MB in the beginning and 204.9 MB in the end (delta: -116.0 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:15:04,617 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 142.1 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:15:04,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.38 ms. Allocated memory is still 142.1 MB. Free memory was 88.7 MB in the beginning and 79.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:15:04,619 INFO L168 Benchmark]: Boogie Preprocessor took 113.22 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 79.5 MB in the beginning and 178.3 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:15:04,620 INFO L168 Benchmark]: RCFGBuilder took 230.94 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 166.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:15:04,623 INFO L168 Benchmark]: TraceAbstraction took 100733.37 ms. Allocated memory was 200.3 MB in the beginning and 345.5 MB in the end (delta: 145.2 MB). Free memory was 165.8 MB in the beginning and 204.9 MB in the end (delta: -39.1 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:15:04,633 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.42 ms. Allocated memory is still 142.1 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 283.38 ms. Allocated memory is still 142.1 MB. Free memory was 88.7 MB in the beginning and 79.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.22 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 79.5 MB in the beginning and 178.3 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 230.94 ms. Allocated memory is still 200.3 MB. Free memory was 178.3 MB in the beginning and 166.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100733.37 ms. Allocated memory was 200.3 MB in the beginning and 345.5 MB in the end (delta: 145.2 MB). Free memory was 165.8 MB in the beginning and 204.9 MB in the end (delta: -39.1 MB). Peak memory consumption was 106.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: 14]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (x <= 0 && 0 <= x) || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 100.6s OverallTime, 14 OverallIterations, 80 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 127 SDslu, 1152 SDs, 0 SdLazy, 3188 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 630 SyntacticMatches, 10 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 22 PreInvPairs, 144 NumberOfFragments, 60 HoareAnnotationTreeSize, 22 FomulaSimplifications, 35831 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 170 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 73.7s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 1385 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 1359 ConstructedInterpolants, 2 QuantifiedInterpolants, 424684 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1445 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 12466/26555 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...