java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label28_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:04:57,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:04:57,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:04:57,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:04:57,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:04:57,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:04:57,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:04:57,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:04:57,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:04:57,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:04:57,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:04:57,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:04:57,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:04:57,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:04:57,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:04:57,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:04:57,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:04:57,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:04:57,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:04:57,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:04:57,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:04:57,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:04:57,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:04:57,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:04:57,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:04:57,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:04:57,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:04:57,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:04:57,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:04:57,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:04:57,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:04:57,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:04:57,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:04:57,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:04:57,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:04:57,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:04:57,237 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:04:57,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:04:57,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:04:57,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:04:57,262 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:04:57,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:04:57,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:04:57,263 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:04:57,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:04:57,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:04:57,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:04:57,264 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:04:57,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:04:57,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:04:57,265 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:04:57,265 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:04:57,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:04:57,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:04:57,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:04:57,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:04:57,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:04:57,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:04:57,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:04:57,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:04:57,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:04:57,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:04:57,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:04:57,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:04:57,268 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:04:57,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:04:57,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:04:57,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:04:57,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:04:57,336 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:04:57,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label28_true-unreach-call.c [2018-10-24 16:04:57,406 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/38d66e4d1/4e5b6bbd5d104d6d8488502d77d378c6/FLAG7b816fcca [2018-10-24 16:04:58,053 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:04:58,057 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label28_true-unreach-call.c [2018-10-24 16:04:58,074 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/38d66e4d1/4e5b6bbd5d104d6d8488502d77d378c6/FLAG7b816fcca [2018-10-24 16:04:58,096 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/38d66e4d1/4e5b6bbd5d104d6d8488502d77d378c6 [2018-10-24 16:04:58,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:04:58,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:04:58,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:04:58,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:04:58,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:04:58,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:04:58" (1/1) ... [2018-10-24 16:04:58,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5211ccae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:58, skipping insertion in model container [2018-10-24 16:04:58,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:04:58" (1/1) ... [2018-10-24 16:04:58,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:04:58,209 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:04:58,860 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:04:58,864 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:04:59,040 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:04:59,065 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:04:59,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59 WrapperNode [2018-10-24 16:04:59,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:04:59,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:04:59,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:04:59,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:04:59,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:04:59,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:04:59,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:04:59,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:04:59,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... [2018-10-24 16:04:59,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:04:59,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:04:59,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:04:59,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:04:59,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:04:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:04:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:04:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:05:03,774 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:05:03,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:05:03 BoogieIcfgContainer [2018-10-24 16:05:03,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:05:03,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:05:03,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:05:03,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:05:03,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:04:58" (1/3) ... [2018-10-24 16:05:03,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be63971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:05:03, skipping insertion in model container [2018-10-24 16:05:03,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:59" (2/3) ... [2018-10-24 16:05:03,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be63971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:05:03, skipping insertion in model container [2018-10-24 16:05:03,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:05:03" (3/3) ... [2018-10-24 16:05:03,789 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label28_true-unreach-call.c [2018-10-24 16:05:03,801 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:05:03,817 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:05:03,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:05:03,887 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:05:03,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:05:03,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:05:03,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:05:03,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:05:03,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:05:03,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:05:03,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:05:03,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:05:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-24 16:05:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 16:05:03,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:03,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:03,933 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:03,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash 55000978, now seen corresponding path program 1 times [2018-10-24 16:05:03,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:03,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:04,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:04,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:04,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:04,458 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-24 16:05:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:08,260 INFO L93 Difference]: Finished difference Result 972 states and 1744 transitions. [2018-10-24 16:05:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:08,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-24 16:05:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:08,300 INFO L225 Difference]: With dead ends: 972 [2018-10-24 16:05:08,300 INFO L226 Difference]: Without dead ends: 681 [2018-10-24 16:05:08,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-24 16:05:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 469. [2018-10-24 16:05:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-24 16:05:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 728 transitions. [2018-10-24 16:05:08,400 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 728 transitions. Word has length 49 [2018-10-24 16:05:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:08,401 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 728 transitions. [2018-10-24 16:05:08,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 728 transitions. [2018-10-24 16:05:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-24 16:05:08,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:08,409 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:08,409 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:08,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1093376710, now seen corresponding path program 1 times [2018-10-24 16:05:08,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:08,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:08,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:08,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:08,677 INFO L87 Difference]: Start difference. First operand 469 states and 728 transitions. Second operand 4 states. [2018-10-24 16:05:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:12,496 INFO L93 Difference]: Finished difference Result 1695 states and 2717 transitions. [2018-10-24 16:05:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:12,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-10-24 16:05:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:12,504 INFO L225 Difference]: With dead ends: 1695 [2018-10-24 16:05:12,504 INFO L226 Difference]: Without dead ends: 1228 [2018-10-24 16:05:12,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-10-24 16:05:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1214. [2018-10-24 16:05:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-10-24 16:05:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1784 transitions. [2018-10-24 16:05:12,567 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1784 transitions. Word has length 118 [2018-10-24 16:05:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:12,568 INFO L481 AbstractCegarLoop]: Abstraction has 1214 states and 1784 transitions. [2018-10-24 16:05:12,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1784 transitions. [2018-10-24 16:05:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-24 16:05:12,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:12,574 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:12,574 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:12,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1523603117, now seen corresponding path program 1 times [2018-10-24 16:05:12,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:12,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:12,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 16:05:12,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:05:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:05:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:12,813 INFO L87 Difference]: Start difference. First operand 1214 states and 1784 transitions. Second operand 3 states. [2018-10-24 16:05:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:16,157 INFO L93 Difference]: Finished difference Result 3354 states and 4986 transitions. [2018-10-24 16:05:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:16,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-24 16:05:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:16,171 INFO L225 Difference]: With dead ends: 3354 [2018-10-24 16:05:16,171 INFO L226 Difference]: Without dead ends: 2142 [2018-10-24 16:05:16,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2018-10-24 16:05:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2018-10-24 16:05:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-10-24 16:05:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2951 transitions. [2018-10-24 16:05:16,224 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2951 transitions. Word has length 143 [2018-10-24 16:05:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:16,224 INFO L481 AbstractCegarLoop]: Abstraction has 2142 states and 2951 transitions. [2018-10-24 16:05:16,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:05:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2951 transitions. [2018-10-24 16:05:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-24 16:05:16,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:16,232 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:16,233 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash -513320534, now seen corresponding path program 1 times [2018-10-24 16:05:16,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:16,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:16,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:16,786 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 16:05:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:16,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:16,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:16,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:16,837 INFO L87 Difference]: Start difference. First operand 2142 states and 2951 transitions. Second operand 4 states. [2018-10-24 16:05:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:19,416 INFO L93 Difference]: Finished difference Result 5779 states and 8068 transitions. [2018-10-24 16:05:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:19,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-10-24 16:05:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:19,434 INFO L225 Difference]: With dead ends: 5779 [2018-10-24 16:05:19,435 INFO L226 Difference]: Without dead ends: 3639 [2018-10-24 16:05:19,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-10-24 16:05:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3622. [2018-10-24 16:05:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-10-24 16:05:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4739 transitions. [2018-10-24 16:05:19,516 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4739 transitions. Word has length 239 [2018-10-24 16:05:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:19,517 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 4739 transitions. [2018-10-24 16:05:19,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4739 transitions. [2018-10-24 16:05:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-24 16:05:19,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:19,524 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:19,524 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:19,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -725868575, now seen corresponding path program 1 times [2018-10-24 16:05:19,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:19,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:20,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:20,176 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 16:05:20,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:20,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:21,418 WARN L179 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 488 DAG size of output: 21 [2018-10-24 16:05:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 16:05:21,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:21,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 16:05:21,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:05:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:05:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:05:21,697 INFO L87 Difference]: Start difference. First operand 3622 states and 4739 transitions. Second operand 6 states. [2018-10-24 16:05:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:31,201 INFO L93 Difference]: Finished difference Result 14159 states and 18682 transitions. [2018-10-24 16:05:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:05:31,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2018-10-24 16:05:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:31,242 INFO L225 Difference]: With dead ends: 14159 [2018-10-24 16:05:31,243 INFO L226 Difference]: Without dead ends: 10539 [2018-10-24 16:05:31,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:05:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2018-10-24 16:05:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 9397. [2018-10-24 16:05:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9397 states. [2018-10-24 16:05:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9397 states to 9397 states and 11813 transitions. [2018-10-24 16:05:31,452 INFO L78 Accepts]: Start accepts. Automaton has 9397 states and 11813 transitions. Word has length 260 [2018-10-24 16:05:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:31,453 INFO L481 AbstractCegarLoop]: Abstraction has 9397 states and 11813 transitions. [2018-10-24 16:05:31,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:05:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9397 states and 11813 transitions. [2018-10-24 16:05:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-24 16:05:31,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:31,464 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:31,464 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -502869374, now seen corresponding path program 1 times [2018-10-24 16:05:31,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:32,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:32,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:05:32,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:05:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:32,038 INFO L87 Difference]: Start difference. First operand 9397 states and 11813 transitions. Second operand 5 states. [2018-10-24 16:05:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:34,858 INFO L93 Difference]: Finished difference Result 19174 states and 24317 transitions. [2018-10-24 16:05:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:05:34,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-24 16:05:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:34,890 INFO L225 Difference]: With dead ends: 19174 [2018-10-24 16:05:34,890 INFO L226 Difference]: Without dead ends: 9779 [2018-10-24 16:05:34,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2018-10-24 16:05:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 9774. [2018-10-24 16:05:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9774 states. [2018-10-24 16:05:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9774 states to 9774 states and 11925 transitions. [2018-10-24 16:05:35,054 INFO L78 Accepts]: Start accepts. Automaton has 9774 states and 11925 transitions. Word has length 266 [2018-10-24 16:05:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:35,055 INFO L481 AbstractCegarLoop]: Abstraction has 9774 states and 11925 transitions. [2018-10-24 16:05:35,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:05:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9774 states and 11925 transitions. [2018-10-24 16:05:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 16:05:35,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:35,063 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:35,063 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:35,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1826592508, now seen corresponding path program 1 times [2018-10-24 16:05:35,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:35,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 11 proven. 82 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 16:05:35,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:35,551 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:35,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:35,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 16:05:35,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:35,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-24 16:05:35,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:05:35,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:05:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:35,874 INFO L87 Difference]: Start difference. First operand 9774 states and 11925 transitions. Second operand 5 states. [2018-10-24 16:05:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:39,277 INFO L93 Difference]: Finished difference Result 31197 states and 37436 transitions. [2018-10-24 16:05:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:05:39,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-24 16:05:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:39,326 INFO L225 Difference]: With dead ends: 31197 [2018-10-24 16:05:39,326 INFO L226 Difference]: Without dead ends: 21425 [2018-10-24 16:05:39,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21425 states. [2018-10-24 16:05:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21425 to 17349. [2018-10-24 16:05:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17349 states. [2018-10-24 16:05:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17349 states to 17349 states and 20272 transitions. [2018-10-24 16:05:39,599 INFO L78 Accepts]: Start accepts. Automaton has 17349 states and 20272 transitions. Word has length 269 [2018-10-24 16:05:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:39,600 INFO L481 AbstractCegarLoop]: Abstraction has 17349 states and 20272 transitions. [2018-10-24 16:05:39,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:05:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17349 states and 20272 transitions. [2018-10-24 16:05:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-24 16:05:39,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:39,611 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:39,612 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:39,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash -463655850, now seen corresponding path program 1 times [2018-10-24 16:05:39,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:39,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 149 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 16:05:40,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:40,021 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:05:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:40,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 16:05:40,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:40,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-24 16:05:40,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:40,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:40,250 INFO L87 Difference]: Start difference. First operand 17349 states and 20272 transitions. Second operand 4 states. [2018-10-24 16:05:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:42,208 INFO L93 Difference]: Finished difference Result 33759 states and 39455 transitions. [2018-10-24 16:05:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:42,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-10-24 16:05:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:42,238 INFO L225 Difference]: With dead ends: 33759 [2018-10-24 16:05:42,238 INFO L226 Difference]: Without dead ends: 16784 [2018-10-24 16:05:42,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16784 states. [2018-10-24 16:05:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16784 to 16414. [2018-10-24 16:05:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16414 states. [2018-10-24 16:05:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16414 states to 16414 states and 18695 transitions. [2018-10-24 16:05:42,459 INFO L78 Accepts]: Start accepts. Automaton has 16414 states and 18695 transitions. Word has length 281 [2018-10-24 16:05:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:42,460 INFO L481 AbstractCegarLoop]: Abstraction has 16414 states and 18695 transitions. [2018-10-24 16:05:42,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 16414 states and 18695 transitions. [2018-10-24 16:05:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 16:05:42,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:42,471 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:42,472 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:42,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1510454922, now seen corresponding path program 1 times [2018-10-24 16:05:42,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:42,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:42,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:42,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:42,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:42,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:42,901 INFO L87 Difference]: Start difference. First operand 16414 states and 18695 transitions. Second operand 4 states. [2018-10-24 16:05:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:44,883 INFO L93 Difference]: Finished difference Result 33950 states and 38657 transitions. [2018-10-24 16:05:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:44,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-10-24 16:05:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:44,917 INFO L225 Difference]: With dead ends: 33950 [2018-10-24 16:05:44,918 INFO L226 Difference]: Without dead ends: 17910 [2018-10-24 16:05:44,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-10-24 16:05:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17156. [2018-10-24 16:05:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17156 states. [2018-10-24 16:05:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17156 states to 17156 states and 19480 transitions. [2018-10-24 16:05:45,146 INFO L78 Accepts]: Start accepts. Automaton has 17156 states and 19480 transitions. Word has length 284 [2018-10-24 16:05:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:45,146 INFO L481 AbstractCegarLoop]: Abstraction has 17156 states and 19480 transitions. [2018-10-24 16:05:45,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17156 states and 19480 transitions. [2018-10-24 16:05:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-24 16:05:45,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:45,162 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:45,163 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1622261481, now seen corresponding path program 1 times [2018-10-24 16:05:45,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:45,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 16:05:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:45,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:45,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:05:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:05:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:45,438 INFO L87 Difference]: Start difference. First operand 17156 states and 19480 transitions. Second operand 3 states. [2018-10-24 16:05:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:47,005 INFO L93 Difference]: Finished difference Result 39487 states and 44913 transitions. [2018-10-24 16:05:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:47,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-24 16:05:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:47,038 INFO L225 Difference]: With dead ends: 39487 [2018-10-24 16:05:47,038 INFO L226 Difference]: Without dead ends: 21404 [2018-10-24 16:05:47,056 INFO L605 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 [2018-10-24 16:05:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21404 states. [2018-10-24 16:05:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21404 to 20664. [2018-10-24 16:05:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20664 states. [2018-10-24 16:05:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20664 states to 20664 states and 23124 transitions. [2018-10-24 16:05:47,307 INFO L78 Accepts]: Start accepts. Automaton has 20664 states and 23124 transitions. Word has length 313 [2018-10-24 16:05:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:47,308 INFO L481 AbstractCegarLoop]: Abstraction has 20664 states and 23124 transitions. [2018-10-24 16:05:47,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:05:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 20664 states and 23124 transitions. [2018-10-24 16:05:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-24 16:05:47,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:47,324 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:47,324 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:47,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1532488535, now seen corresponding path program 1 times [2018-10-24 16:05:47,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:47,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 16:05:47,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:47,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:47,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:05:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:05:47,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:47,706 INFO L87 Difference]: Start difference. First operand 20664 states and 23124 transitions. Second operand 3 states. [2018-10-24 16:05:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:50,894 INFO L93 Difference]: Finished difference Result 41142 states and 46094 transitions. [2018-10-24 16:05:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:50,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-10-24 16:05:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:50,919 INFO L225 Difference]: With dead ends: 41142 [2018-10-24 16:05:50,920 INFO L226 Difference]: Without dead ends: 19548 [2018-10-24 16:05:50,935 INFO L605 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 [2018-10-24 16:05:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19548 states. [2018-10-24 16:05:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19548 to 18991. [2018-10-24 16:05:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18991 states. [2018-10-24 16:05:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18991 states to 18991 states and 21059 transitions. [2018-10-24 16:05:51,284 INFO L78 Accepts]: Start accepts. Automaton has 18991 states and 21059 transitions. Word has length 339 [2018-10-24 16:05:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:51,285 INFO L481 AbstractCegarLoop]: Abstraction has 18991 states and 21059 transitions. [2018-10-24 16:05:51,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:05:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18991 states and 21059 transitions. [2018-10-24 16:05:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-24 16:05:51,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:51,298 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:51,298 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:51,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1361478743, now seen corresponding path program 1 times [2018-10-24 16:05:51,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 16:05:51,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:51,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:51,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:51,664 INFO L87 Difference]: Start difference. First operand 18991 states and 21059 transitions. Second operand 4 states. [2018-10-24 16:05:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:53,342 INFO L93 Difference]: Finished difference Result 36863 states and 40930 transitions. [2018-10-24 16:05:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:53,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2018-10-24 16:05:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:53,362 INFO L225 Difference]: With dead ends: 36863 [2018-10-24 16:05:53,362 INFO L226 Difference]: Without dead ends: 17501 [2018-10-24 16:05:53,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17501 states. [2018-10-24 16:05:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17501 to 17313. [2018-10-24 16:05:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17313 states. [2018-10-24 16:05:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17313 states to 17313 states and 19097 transitions. [2018-10-24 16:05:53,571 INFO L78 Accepts]: Start accepts. Automaton has 17313 states and 19097 transitions. Word has length 340 [2018-10-24 16:05:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:53,572 INFO L481 AbstractCegarLoop]: Abstraction has 17313 states and 19097 transitions. [2018-10-24 16:05:53,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17313 states and 19097 transitions. [2018-10-24 16:05:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-24 16:05:53,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:53,589 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:53,589 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:53,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:53,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1149795893, now seen corresponding path program 1 times [2018-10-24 16:05:53,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:53,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:53,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:53,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:53,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-24 16:05:53,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:53,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:53,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:53,889 INFO L87 Difference]: Start difference. First operand 17313 states and 19097 transitions. Second operand 4 states. [2018-10-24 16:05:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:55,697 INFO L93 Difference]: Finished difference Result 34261 states and 37822 transitions. [2018-10-24 16:05:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:55,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-10-24 16:05:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:55,716 INFO L225 Difference]: With dead ends: 34261 [2018-10-24 16:05:55,716 INFO L226 Difference]: Without dead ends: 17135 [2018-10-24 16:05:55,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2018-10-24 16:05:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 16755. [2018-10-24 16:05:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2018-10-24 16:05:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 18270 transitions. [2018-10-24 16:05:55,935 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 18270 transitions. Word has length 383 [2018-10-24 16:05:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:55,935 INFO L481 AbstractCegarLoop]: Abstraction has 16755 states and 18270 transitions. [2018-10-24 16:05:55,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 18270 transitions. [2018-10-24 16:05:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-24 16:05:55,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:55,952 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:55,953 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:55,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1795904804, now seen corresponding path program 1 times [2018-10-24 16:05:55,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 448 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:56,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:56,549 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:56,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:56,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-24 16:05:56,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 16:05:56,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:05:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:05:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:05:56,885 INFO L87 Difference]: Start difference. First operand 16755 states and 18270 transitions. Second operand 6 states. [2018-10-24 16:05:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:58,495 INFO L93 Difference]: Finished difference Result 32956 states and 35966 transitions. [2018-10-24 16:05:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:58,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 388 [2018-10-24 16:05:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:58,512 INFO L225 Difference]: With dead ends: 32956 [2018-10-24 16:05:58,512 INFO L226 Difference]: Without dead ends: 16760 [2018-10-24 16:05:58,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:05:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16760 states. [2018-10-24 16:05:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16760 to 16755. [2018-10-24 16:05:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2018-10-24 16:05:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 18254 transitions. [2018-10-24 16:05:58,678 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 18254 transitions. Word has length 388 [2018-10-24 16:05:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:58,678 INFO L481 AbstractCegarLoop]: Abstraction has 16755 states and 18254 transitions. [2018-10-24 16:05:58,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:05:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 18254 transitions. [2018-10-24 16:05:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-24 16:05:58,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:58,693 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:58,693 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:58,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 768596239, now seen corresponding path program 1 times [2018-10-24 16:05:58,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:58,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:59,219 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 16:05:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 246 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:59,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:59,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:59,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:00,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 246 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:06:01,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:01,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-24 16:06:01,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:06:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:06:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:06:01,111 INFO L87 Difference]: Start difference. First operand 16755 states and 18254 transitions. Second operand 12 states. [2018-10-24 16:06:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:11,665 INFO L93 Difference]: Finished difference Result 38389 states and 41730 transitions. [2018-10-24 16:06:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 16:06:11,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 419 [2018-10-24 16:06:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:11,684 INFO L225 Difference]: With dead ends: 38389 [2018-10-24 16:06:11,684 INFO L226 Difference]: Without dead ends: 22193 [2018-10-24 16:06:11,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-10-24 16:06:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22193 states. [2018-10-24 16:06:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22193 to 16559. [2018-10-24 16:06:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16559 states. [2018-10-24 16:06:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16559 states to 16559 states and 17964 transitions. [2018-10-24 16:06:11,854 INFO L78 Accepts]: Start accepts. Automaton has 16559 states and 17964 transitions. Word has length 419 [2018-10-24 16:06:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:11,854 INFO L481 AbstractCegarLoop]: Abstraction has 16559 states and 17964 transitions. [2018-10-24 16:06:11,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:06:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 16559 states and 17964 transitions. [2018-10-24 16:06:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-24 16:06:11,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:11,864 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:11,864 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2089389463, now seen corresponding path program 1 times [2018-10-24 16:06:11,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:11,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 339 proven. 121 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 16:06:12,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:12,582 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:12,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:12,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-10-24 16:06:13,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:06:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2018-10-24 16:06:13,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:06:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:06:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:06:13,117 INFO L87 Difference]: Start difference. First operand 16559 states and 17964 transitions. Second operand 8 states. [2018-10-24 16:06:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:14,783 INFO L93 Difference]: Finished difference Result 32578 states and 35364 transitions. [2018-10-24 16:06:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:06:14,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 420 [2018-10-24 16:06:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:14,796 INFO L225 Difference]: With dead ends: 32578 [2018-10-24 16:06:14,796 INFO L226 Difference]: Without dead ends: 16373 [2018-10-24 16:06:14,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 415 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:06:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16373 states. [2018-10-24 16:06:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16373 to 16373. [2018-10-24 16:06:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16373 states. [2018-10-24 16:06:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16373 states to 16373 states and 17739 transitions. [2018-10-24 16:06:14,924 INFO L78 Accepts]: Start accepts. Automaton has 16373 states and 17739 transitions. Word has length 420 [2018-10-24 16:06:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:14,924 INFO L481 AbstractCegarLoop]: Abstraction has 16373 states and 17739 transitions. [2018-10-24 16:06:14,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:06:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16373 states and 17739 transitions. [2018-10-24 16:06:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-24 16:06:14,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:14,932 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:14,933 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1110516759, now seen corresponding path program 1 times [2018-10-24 16:06:14,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 322 proven. 103 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 16:06:15,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:15,455 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:15,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:15,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 322 proven. 103 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 16:06:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-24 16:06:15,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:06:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:06:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:06:15,744 INFO L87 Difference]: Start difference. First operand 16373 states and 17739 transitions. Second operand 5 states. [2018-10-24 16:06:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:18,033 INFO L93 Difference]: Finished difference Result 37755 states and 40959 transitions. [2018-10-24 16:06:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:06:18,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 426 [2018-10-24 16:06:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:18,063 INFO L225 Difference]: With dead ends: 37755 [2018-10-24 16:06:18,063 INFO L226 Difference]: Without dead ends: 21941 [2018-10-24 16:06:18,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:06:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21941 states. [2018-10-24 16:06:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21941 to 18222. [2018-10-24 16:06:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18222 states. [2018-10-24 16:06:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18222 states to 18222 states and 19606 transitions. [2018-10-24 16:06:18,258 INFO L78 Accepts]: Start accepts. Automaton has 18222 states and 19606 transitions. Word has length 426 [2018-10-24 16:06:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:18,259 INFO L481 AbstractCegarLoop]: Abstraction has 18222 states and 19606 transitions. [2018-10-24 16:06:18,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:06:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18222 states and 19606 transitions. [2018-10-24 16:06:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-24 16:06:18,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:18,272 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:18,272 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:18,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash -642383833, now seen corresponding path program 1 times [2018-10-24 16:06:18,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:18,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:18,644 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-24 16:06:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-24 16:06:18,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:06:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:06:18,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:06:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:06:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:06:18,790 INFO L87 Difference]: Start difference. First operand 18222 states and 19606 transitions. Second operand 4 states. [2018-10-24 16:06:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:20,645 INFO L93 Difference]: Finished difference Result 36639 states and 39405 transitions. [2018-10-24 16:06:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:06:20,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2018-10-24 16:06:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:20,666 INFO L225 Difference]: With dead ends: 36639 [2018-10-24 16:06:20,666 INFO L226 Difference]: Without dead ends: 18605 [2018-10-24 16:06:20,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:06:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18605 states. [2018-10-24 16:06:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18605 to 16739. [2018-10-24 16:06:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16739 states. [2018-10-24 16:06:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16739 states to 16739 states and 17879 transitions. [2018-10-24 16:06:20,827 INFO L78 Accepts]: Start accepts. Automaton has 16739 states and 17879 transitions. Word has length 479 [2018-10-24 16:06:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:20,828 INFO L481 AbstractCegarLoop]: Abstraction has 16739 states and 17879 transitions. [2018-10-24 16:06:20,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:06:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16739 states and 17879 transitions. [2018-10-24 16:06:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-24 16:06:20,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:20,843 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:20,843 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:20,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2025793875, now seen corresponding path program 1 times [2018-10-24 16:06:20,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:20,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-10-24 16:06:21,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:06:21,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:06:21,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:06:21,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:06:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:06:21,438 INFO L87 Difference]: Start difference. First operand 16739 states and 17879 transitions. Second operand 3 states. [2018-10-24 16:06:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:23,379 INFO L93 Difference]: Finished difference Result 32910 states and 35124 transitions. [2018-10-24 16:06:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:06:23,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2018-10-24 16:06:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:23,392 INFO L225 Difference]: With dead ends: 32910 [2018-10-24 16:06:23,392 INFO L226 Difference]: Without dead ends: 13567 [2018-10-24 16:06:23,401 INFO L605 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 [2018-10-24 16:06:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13567 states. [2018-10-24 16:06:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13567 to 12272. [2018-10-24 16:06:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12272 states. [2018-10-24 16:06:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12272 states to 12272 states and 12965 transitions. [2018-10-24 16:06:23,505 INFO L78 Accepts]: Start accepts. Automaton has 12272 states and 12965 transitions. Word has length 491 [2018-10-24 16:06:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:23,506 INFO L481 AbstractCegarLoop]: Abstraction has 12272 states and 12965 transitions. [2018-10-24 16:06:23,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:06:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12272 states and 12965 transitions. [2018-10-24 16:06:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-24 16:06:23,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:23,517 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:23,518 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:23,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1563719829, now seen corresponding path program 1 times [2018-10-24 16:06:23,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:23,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:24,050 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 16:06:24,493 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-24 16:06:24,944 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-10-24 16:06:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 550 proven. 224 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 16:06:25,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:25,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:25,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:25,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:26,320 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:06:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 550 proven. 224 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 16:06:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:27,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2018-10-24 16:06:27,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 16:06:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 16:06:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:06:27,222 INFO L87 Difference]: Start difference. First operand 12272 states and 12965 transitions. Second operand 13 states. [2018-10-24 16:06:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:34,900 INFO L93 Difference]: Finished difference Result 27974 states and 29498 transitions. [2018-10-24 16:06:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 16:06:34,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 539 [2018-10-24 16:06:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:34,915 INFO L225 Difference]: With dead ends: 27974 [2018-10-24 16:06:34,915 INFO L226 Difference]: Without dead ends: 16261 [2018-10-24 16:06:34,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 534 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-10-24 16:06:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2018-10-24 16:06:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 10599. [2018-10-24 16:06:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10599 states. [2018-10-24 16:06:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 11191 transitions. [2018-10-24 16:06:35,039 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 11191 transitions. Word has length 539 [2018-10-24 16:06:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:35,039 INFO L481 AbstractCegarLoop]: Abstraction has 10599 states and 11191 transitions. [2018-10-24 16:06:35,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 16:06:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 11191 transitions. [2018-10-24 16:06:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-10-24 16:06:35,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:35,048 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:35,048 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:35,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash -573851852, now seen corresponding path program 1 times [2018-10-24 16:06:35,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:35,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-24 16:06:35,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:35,890 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:06:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:36,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 239 proven. 457 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-24 16:06:37,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:37,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 16:06:37,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:06:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:06:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:06:37,269 INFO L87 Difference]: Start difference. First operand 10599 states and 11191 transitions. Second operand 9 states. [2018-10-24 16:06:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:42,620 INFO L93 Difference]: Finished difference Result 33797 states and 35715 transitions. [2018-10-24 16:06:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:06:42,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 575 [2018-10-24 16:06:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:42,643 INFO L225 Difference]: With dead ends: 33797 [2018-10-24 16:06:42,643 INFO L226 Difference]: Without dead ends: 23200 [2018-10-24 16:06:42,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:06:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23200 states. [2018-10-24 16:06:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23200 to 13012. [2018-10-24 16:06:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13012 states. [2018-10-24 16:06:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13012 states to 13012 states and 13702 transitions. [2018-10-24 16:06:42,808 INFO L78 Accepts]: Start accepts. Automaton has 13012 states and 13702 transitions. Word has length 575 [2018-10-24 16:06:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:42,808 INFO L481 AbstractCegarLoop]: Abstraction has 13012 states and 13702 transitions. [2018-10-24 16:06:42,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:06:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13012 states and 13702 transitions. [2018-10-24 16:06:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-24 16:06:42,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:42,817 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:42,817 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:42,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1119073345, now seen corresponding path program 1 times [2018-10-24 16:06:42,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:42,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:42,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-10-24 16:06:43,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:06:43,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:06:43,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:06:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:06:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:06:43,515 INFO L87 Difference]: Start difference. First operand 13012 states and 13702 transitions. Second operand 5 states. [2018-10-24 16:06:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:45,467 INFO L93 Difference]: Finished difference Result 29174 states and 30763 transitions. [2018-10-24 16:06:45,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:06:45,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 625 [2018-10-24 16:06:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:45,484 INFO L225 Difference]: With dead ends: 29174 [2018-10-24 16:06:45,485 INFO L226 Difference]: Without dead ends: 17457 [2018-10-24 16:06:45,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:06:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17457 states. [2018-10-24 16:06:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17457 to 15230. [2018-10-24 16:06:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15230 states. [2018-10-24 16:06:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15230 states to 15230 states and 16038 transitions. [2018-10-24 16:06:45,652 INFO L78 Accepts]: Start accepts. Automaton has 15230 states and 16038 transitions. Word has length 625 [2018-10-24 16:06:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:45,652 INFO L481 AbstractCegarLoop]: Abstraction has 15230 states and 16038 transitions. [2018-10-24 16:06:45,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:06:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15230 states and 16038 transitions. [2018-10-24 16:06:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-10-24 16:06:45,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:45,662 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:45,662 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1804517051, now seen corresponding path program 1 times [2018-10-24 16:06:45,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 756 proven. 239 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-24 16:06:46,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:46,456 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:06:46,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:46,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 756 proven. 239 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-24 16:06:47,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:47,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-24 16:06:47,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:06:47,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:06:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:06:47,126 INFO L87 Difference]: Start difference. First operand 15230 states and 16038 transitions. Second operand 5 states. [2018-10-24 16:06:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:49,393 INFO L93 Difference]: Finished difference Result 32317 states and 33996 transitions. [2018-10-24 16:06:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:06:49,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 647 [2018-10-24 16:06:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:49,403 INFO L225 Difference]: With dead ends: 32317 [2018-10-24 16:06:49,403 INFO L226 Difference]: Without dead ends: 12042 [2018-10-24 16:06:49,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 646 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:06:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12042 states. [2018-10-24 16:06:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12042 to 7231. [2018-10-24 16:06:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7231 states. [2018-10-24 16:06:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 7456 transitions. [2018-10-24 16:06:49,510 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 7456 transitions. Word has length 647 [2018-10-24 16:06:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:49,510 INFO L481 AbstractCegarLoop]: Abstraction has 7231 states and 7456 transitions. [2018-10-24 16:06:49,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:06:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 7456 transitions. [2018-10-24 16:06:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2018-10-24 16:06:49,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:49,519 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:49,519 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:49,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1254010192, now seen corresponding path program 1 times [2018-10-24 16:06:49,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:49,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:49,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:49,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:49,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:50,289 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:06:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1331 proven. 220 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2018-10-24 16:06:50,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:50,957 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:50,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:51,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1284 proven. 97 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-10-24 16:06:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:52,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-10-24 16:06:52,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:06:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:06:52,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:06:52,279 INFO L87 Difference]: Start difference. First operand 7231 states and 7456 transitions. Second operand 8 states. [2018-10-24 16:06:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:57,755 INFO L93 Difference]: Finished difference Result 18720 states and 19344 transitions. [2018-10-24 16:06:57,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:06:57,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 850 [2018-10-24 16:06:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:57,766 INFO L225 Difference]: With dead ends: 18720 [2018-10-24 16:06:57,766 INFO L226 Difference]: Without dead ends: 12784 [2018-10-24 16:06:57,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:06:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12784 states. [2018-10-24 16:06:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12784 to 7230. [2018-10-24 16:06:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2018-10-24 16:06:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 7446 transitions. [2018-10-24 16:06:57,867 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 7446 transitions. Word has length 850 [2018-10-24 16:06:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:57,867 INFO L481 AbstractCegarLoop]: Abstraction has 7230 states and 7446 transitions. [2018-10-24 16:06:57,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:06:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 7446 transitions. [2018-10-24 16:06:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-10-24 16:06:57,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:57,878 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:57,878 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:57,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:57,878 INFO L82 PathProgramCache]: Analyzing trace with hash -65126266, now seen corresponding path program 1 times [2018-10-24 16:06:57,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:57,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:57,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 1705 proven. 294 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-10-24 16:06:59,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:59,029 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:06:59,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:59,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:07:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 396 proven. 2011 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-24 16:07:01,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:07:01,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-24 16:07:01,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 16:07:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 16:07:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-24 16:07:01,131 INFO L87 Difference]: Start difference. First operand 7230 states and 7446 transitions. Second operand 14 states. [2018-10-24 16:07:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:07:07,980 INFO L93 Difference]: Finished difference Result 11305 states and 11660 transitions. [2018-10-24 16:07:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 16:07:07,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 999 [2018-10-24 16:07:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:07:07,982 INFO L225 Difference]: With dead ends: 11305 [2018-10-24 16:07:07,982 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 16:07:07,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1007 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2018-10-24 16:07:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 16:07:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 16:07:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 16:07:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 16:07:07,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 999 [2018-10-24 16:07:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:07:07,987 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 16:07:07,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 16:07:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 16:07:07,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 16:07:07,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 16:07:08,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:08,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:08,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:08,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:08,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:09,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:09,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:10,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:10,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:10,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:11,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,229 WARN L179 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 916 DAG size of output: 734 [2018-10-24 16:07:12,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:12,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:13,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:13,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:13,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:07:14,888 WARN L179 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 913 DAG size of output: 734 [2018-10-24 16:07:27,697 WARN L179 SmtUtils]: Spent 12.79 s on a formula simplification. DAG size of input: 688 DAG size of output: 167 [2018-10-24 16:07:39,838 WARN L179 SmtUtils]: Spent 12.13 s on a formula simplification. DAG size of input: 688 DAG size of output: 167 [2018-10-24 16:07:39,842 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,843 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,844 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-10-24 16:07:39,845 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-10-24 16:07:39,846 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,846 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-10-24 16:07:39,846 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse31 (+ ~a23~0 43)) (.cse22 (= ~a25~0 13)) (.cse21 (= ~a25~0 9)) (.cse18 (= ~a4~0 1)) (.cse28 (<= ~a29~0 245)) (.cse14 (= ~a25~0 10))) (let ((.cse19 (<= ~a29~0 277)) (.cse5 (and (not .cse21) .cse18 .cse28 (not .cse14))) (.cse11 (not .cse22)) (.cse16 (<= 0 (+ ~a23~0 600262))) (.cse12 (<= 0 (+ ~a23~0 599913))) (.cse27 (<= 260 ~a29~0)) (.cse15 (= 1 ~a3~0)) (.cse26 (exists ((v_~a23~0_479 Int)) (and (< 0 (+ v_~a23~0_479 43)) (<= (* 5 v_~a23~0_479) (+ ~a23~0 577632))))) (.cse10 (<= ~a4~0 0)) (.cse9 (<= ~a29~0 140)) (.cse24 (< 0 .cse31)) (.cse6 (<= 312 ~a23~0)) (.cse1 (and .cse18 .cse28)) (.cse25 (< 140 ~a29~0)) (.cse7 (= ~a25~0 11)) (.cse0 (= ~a25~0 12)) (.cse8 (= 15 ~a8~0)) (.cse3 (< 138 ~a23~0)) (.cse13 (<= .cse31 0)) (.cse20 (< 245 ~a29~0)) (.cse17 (= ~a8~0 15)) (.cse23 (<= ~a23~0 138)) (.cse4 (= ~a3~0 1))) (or (and (let ((.cse2 (<= 141 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (and .cse5 .cse6) .cse7) .cse2 .cse4))) .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse8 .cse13 .cse4) (and (and .cse9 .cse10 .cse14) .cse15 .cse16 .cse8) (or (and .cse0 .cse17 .cse18 .cse19 .cse20 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse20 .cse4)) (or (and .cse0 .cse17 .cse10 .cse19 .cse20 .cse4) (and (and .cse17 (and .cse21 .cse10 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) .cse13)) .cse4)) (and .cse17 .cse18 (<= ~a23~0 306) .cse7 .cse4 .cse3) (and .cse22 .cse10 .cse23 .cse8 .cse24 .cse4) (and .cse21 .cse18 .cse13) (and .cse9 .cse0 .cse17 .cse18 .cse23 .cse4) (and .cse22 .cse17 .cse5 .cse25 .cse4 .cse13) (and .cse25 .cse18 .cse7 .cse13) (and .cse10 .cse11 .cse8 .cse26 .cse27 .cse4 .cse13) (and .cse17 .cse18 .cse14 .cse4) (and .cse9 .cse21 .cse18) (and (and .cse9 .cse10 .cse7 .cse13) .cse15 .cse16 .cse8) (and (and (and .cse0 .cse28 .cse10) .cse4) .cse12 .cse8) (and (and .cse18 .cse7 .cse27 .cse3) .cse15 .cse8) (and .cse18 .cse8 .cse0 (exists ((v_prenex_45 Int) (v_prenex_46 Int)) (and (< v_prenex_46 0) (<= (+ (div v_prenex_46 5) 553469) ~a23~0) (<= (* 5 v_prenex_45) (+ v_prenex_46 577632)) (< 0 (+ v_prenex_45 43)) (not (= 0 (mod v_prenex_46 5))) (<= (+ v_prenex_46 43) 0))) (<= ~a29~0 220) .cse4) (and .cse3 (and .cse22 .cse17 .cse18 .cse4)) (and (and (and .cse0 .cse10 .cse23 .cse4) .cse26) .cse8) (and .cse10 .cse23 .cse8 .cse9 (not .cse7) .cse24 .cse4) (and .cse17 .cse18 (exists ((v_prenex_18 Int)) (let ((.cse30 (* 12 v_prenex_18))) (let ((.cse29 (div .cse30 10))) (and (<= 0 .cse29) (<= 0 .cse30) (<= (+ (div .cse29 5) 99853) ~a29~0) (< 245 v_prenex_18) (<= 0 (+ .cse29 1)))))) .cse7 .cse4) (and (and .cse21 .cse17 .cse6 .cse18) .cse4) (and .cse1 .cse17 .cse25 .cse23 .cse7 .cse4) (and .cse0 .cse18 .cse8 (<= ~a23~0 247) .cse4 .cse3) (and .cse18 .cse14 .cse13) (and (and .cse21 .cse17 .cse18 .cse4) .cse20) (and .cse21 .cse17 .cse18 .cse23 .cse4)))) [2018-10-24 16:07:39,847 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,847 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,847 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,847 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-24 16:07:39,850 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,851 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,852 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,853 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-10-24 16:07:39,854 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,855 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-10-24 16:07:39,856 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,857 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,858 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,859 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,860 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-10-24 16:07:39,861 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,862 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,863 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,864 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-10-24 16:07:39,865 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,866 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,867 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-10-24 16:07:39,868 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,869 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,870 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,871 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse31 (+ ~a23~0 43)) (.cse22 (= ~a25~0 13)) (.cse21 (= ~a25~0 9)) (.cse18 (= ~a4~0 1)) (.cse28 (<= ~a29~0 245)) (.cse14 (= ~a25~0 10))) (let ((.cse19 (<= ~a29~0 277)) (.cse5 (and (not .cse21) .cse18 .cse28 (not .cse14))) (.cse11 (not .cse22)) (.cse16 (<= 0 (+ ~a23~0 600262))) (.cse12 (<= 0 (+ ~a23~0 599913))) (.cse27 (<= 260 ~a29~0)) (.cse15 (= 1 ~a3~0)) (.cse26 (exists ((v_~a23~0_479 Int)) (and (< 0 (+ v_~a23~0_479 43)) (<= (* 5 v_~a23~0_479) (+ ~a23~0 577632))))) (.cse10 (<= ~a4~0 0)) (.cse9 (<= ~a29~0 140)) (.cse24 (< 0 .cse31)) (.cse6 (<= 312 ~a23~0)) (.cse1 (and .cse18 .cse28)) (.cse25 (< 140 ~a29~0)) (.cse7 (= ~a25~0 11)) (.cse0 (= ~a25~0 12)) (.cse8 (= 15 ~a8~0)) (.cse3 (< 138 ~a23~0)) (.cse13 (<= .cse31 0)) (.cse20 (< 245 ~a29~0)) (.cse17 (= ~a8~0 15)) (.cse23 (<= ~a23~0 138)) (.cse4 (= ~a3~0 1))) (or (and (let ((.cse2 (<= 141 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (and .cse5 .cse6) .cse7) .cse2 .cse4))) .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse8 .cse13 .cse4) (and (and .cse9 .cse10 .cse14) .cse15 .cse16 .cse8) (or (and .cse0 .cse17 .cse18 .cse19 .cse20 .cse3 .cse4) (and .cse17 .cse18 .cse19 .cse7 .cse20 .cse4)) (or (and .cse0 .cse17 .cse10 .cse19 .cse20 .cse4) (and (and .cse17 (and .cse21 .cse10 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) .cse13)) .cse4)) (and .cse17 .cse18 (<= ~a23~0 306) .cse7 .cse4 .cse3) (and .cse22 .cse10 .cse23 .cse8 .cse24 .cse4) (and .cse21 .cse18 .cse13) (and .cse9 .cse0 .cse17 .cse18 .cse23 .cse4) (and .cse22 .cse17 .cse5 .cse25 .cse4 .cse13) (and .cse25 .cse18 .cse7 .cse13) (and .cse10 .cse11 .cse8 .cse26 .cse27 .cse4 .cse13) (and .cse17 .cse18 .cse14 .cse4) (and .cse9 .cse21 .cse18) (and (and .cse9 .cse10 .cse7 .cse13) .cse15 .cse16 .cse8) (and (and (and .cse0 .cse28 .cse10) .cse4) .cse12 .cse8) (and (and .cse18 .cse7 .cse27 .cse3) .cse15 .cse8) (and .cse18 .cse8 .cse0 (exists ((v_prenex_45 Int) (v_prenex_46 Int)) (and (< v_prenex_46 0) (<= (+ (div v_prenex_46 5) 553469) ~a23~0) (<= (* 5 v_prenex_45) (+ v_prenex_46 577632)) (< 0 (+ v_prenex_45 43)) (not (= 0 (mod v_prenex_46 5))) (<= (+ v_prenex_46 43) 0))) (<= ~a29~0 220) .cse4) (and .cse3 (and .cse22 .cse17 .cse18 .cse4)) (and (and (and .cse0 .cse10 .cse23 .cse4) .cse26) .cse8) (and .cse10 .cse23 .cse8 .cse9 (not .cse7) .cse24 .cse4) (and .cse17 .cse18 (exists ((v_prenex_18 Int)) (let ((.cse30 (* 12 v_prenex_18))) (let ((.cse29 (div .cse30 10))) (and (<= 0 .cse29) (<= 0 .cse30) (<= (+ (div .cse29 5) 99853) ~a29~0) (< 245 v_prenex_18) (<= 0 (+ .cse29 1)))))) .cse7 .cse4) (and (and .cse21 .cse17 .cse6 .cse18) .cse4) (and .cse1 .cse17 .cse25 .cse23 .cse7 .cse4) (and .cse0 .cse18 .cse8 (<= ~a23~0 247) .cse4 .cse3) (and .cse18 .cse14 .cse13) (and (and .cse21 .cse17 .cse18 .cse4) .cse20) (and .cse21 .cse17 .cse18 .cse23 .cse4)))) [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,872 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-10-24 16:07:39,885 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,886 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,889 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,891 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,891 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,891 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,891 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,907 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,908 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,916 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,929 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,930 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,931 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:07:39 BoogieIcfgContainer [2018-10-24 16:07:39,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:07:39,938 INFO L168 Benchmark]: Toolchain (without parser) took 161829.21 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,939 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:07:39,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 284.54 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,941 INFO L168 Benchmark]: Boogie Preprocessor took 131.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,942 INFO L168 Benchmark]: RCFGBuilder took 4294.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 177.9 MB). Peak memory consumption was 177.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,942 INFO L168 Benchmark]: TraceAbstraction took 156157.46 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -975.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 16:07:39,947 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 955.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 284.54 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4294.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 177.9 MB). Peak memory consumption was 177.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 156157.46 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -975.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-10-24 16:07:39,961 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,961 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,971 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,972 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,972 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,973 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,974 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,974 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,975 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,976 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,977 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a25 == 12 && a4 == 1 && a29 <= 245) && 141 <= a29) && 138 < a23) && a3 == 1) || (((((((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 312 <= a23) && a25 == 11) && 141 <= a29) && a3 == 1)) && 15 == a8) || ((((((a29 <= 140 && a4 <= 0) && !(a25 == 13)) && 0 <= a23 + 599913) && 15 == a8) && a23 + 43 <= 0) && a3 == 1)) || (((((a29 <= 140 && a4 <= 0) && a25 == 10) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8)) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && a29 <= 277) && 245 < a29) && 138 < a23) && a3 == 1) || (((((a8 == 15 && a4 == 1) && a29 <= 277) && a25 == 11) && 245 < a29) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && a29 <= 277) && 245 < a29) && a3 == 1) || ((a8 == 15 && ((a25 == 9 && a4 <= 0) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && a23 + 43 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a23 <= 306) && a25 == 11) && a3 == 1) && 138 < a23)) || (((((a25 == 13 && a4 <= 0) && a23 <= 138) && 15 == a8) && 0 < a23 + 43) && a3 == 1)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((((a29 <= 140 && a25 == 12) && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && ((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 140 < a29) && a3 == 1) && a23 + 43 <= 0)) || (((140 < a29 && a4 == 1) && a25 == 11) && a23 + 43 <= 0)) || ((((((a4 <= 0 && !(a25 == 13)) && 15 == a8) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 260 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1)) || ((a29 <= 140 && a25 == 9) && a4 == 1)) || ((((((a29 <= 140 && a4 <= 0) && a25 == 11) && a23 + 43 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8)) || (((((a25 == 12 && a29 <= 245) && a4 <= 0) && a3 == 1) && 0 <= a23 + 599913) && 15 == a8)) || (((((a4 == 1 && a25 == 11) && 260 <= a29) && 138 < a23) && 1 == a3) && 15 == a8)) || (((((a4 == 1 && 15 == a8) && a25 == 12) && (\exists v_prenex_45 : int, v_prenex_46 : int :: ((((v_prenex_46 < 0 && v_prenex_46 / 5 + 553469 <= a23) && 5 * v_prenex_45 <= v_prenex_46 + 577632) && 0 < v_prenex_45 + 43) && !(0 == v_prenex_46 % 5)) && v_prenex_46 + 43 <= 0)) && a29 <= 220) && a3 == 1)) || (138 < a23 && ((a25 == 13 && a8 == 15) && a4 == 1) && a3 == 1)) || (((((a25 == 12 && a4 <= 0) && a23 <= 138) && a3 == 1) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 15 == a8)) || ((((((a4 <= 0 && a23 <= 138) && 15 == a8) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && a3 == 1)) || ((((a8 == 15 && a4 == 1) && (\exists v_prenex_18 : int :: (((0 <= 12 * v_prenex_18 / 10 && 0 <= 12 * v_prenex_18) && 12 * v_prenex_18 / 10 / 5 + 99853 <= a29) && 245 < v_prenex_18) && 0 <= 12 * v_prenex_18 / 10 + 1)) && a25 == 11) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && 312 <= a23) && a4 == 1) && a3 == 1)) || ((((((a4 == 1 && a29 <= 245) && a8 == 15) && 140 < a29) && a23 <= 138) && a25 == 11) && a3 == 1)) || (((((a25 == 12 && a4 == 1) && 15 == a8) && a23 <= 247) && a3 == 1) && 138 < a23)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a3 == 1) && 245 < a29)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant [2018-10-24 16:07:39,981 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,993 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-10-24 16:07:39,994 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,994 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_45,QUANTIFIED] [2018-10-24 16:07:39,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_46,QUANTIFIED] [2018-10-24 16:07:39,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-10-24 16:07:39,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-10-24 16:07:39,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a25 == 12 && a4 == 1 && a29 <= 245) && 141 <= a29) && 138 < a23) && a3 == 1) || (((((((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 312 <= a23) && a25 == 11) && 141 <= a29) && a3 == 1)) && 15 == a8) || ((((((a29 <= 140 && a4 <= 0) && !(a25 == 13)) && 0 <= a23 + 599913) && 15 == a8) && a23 + 43 <= 0) && a3 == 1)) || (((((a29 <= 140 && a4 <= 0) && a25 == 10) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8)) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && a29 <= 277) && 245 < a29) && 138 < a23) && a3 == 1) || (((((a8 == 15 && a4 == 1) && a29 <= 277) && a25 == 11) && 245 < a29) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && a29 <= 277) && 245 < a29) && a3 == 1) || ((a8 == 15 && ((a25 == 9 && a4 <= 0) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && a23 + 43 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a23 <= 306) && a25 == 11) && a3 == 1) && 138 < a23)) || (((((a25 == 13 && a4 <= 0) && a23 <= 138) && 15 == a8) && 0 < a23 + 43) && a3 == 1)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((((a29 <= 140 && a25 == 12) && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && ((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 140 < a29) && a3 == 1) && a23 + 43 <= 0)) || (((140 < a29 && a4 == 1) && a25 == 11) && a23 + 43 <= 0)) || ((((((a4 <= 0 && !(a25 == 13)) && 15 == a8) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 260 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1)) || ((a29 <= 140 && a25 == 9) && a4 == 1)) || ((((((a29 <= 140 && a4 <= 0) && a25 == 11) && a23 + 43 <= 0) && 1 == a3) && 0 <= a23 + 600262) && 15 == a8)) || (((((a25 == 12 && a29 <= 245) && a4 <= 0) && a3 == 1) && 0 <= a23 + 599913) && 15 == a8)) || (((((a4 == 1 && a25 == 11) && 260 <= a29) && 138 < a23) && 1 == a3) && 15 == a8)) || (((((a4 == 1 && 15 == a8) && a25 == 12) && (\exists v_prenex_45 : int, v_prenex_46 : int :: ((((v_prenex_46 < 0 && v_prenex_46 / 5 + 553469 <= a23) && 5 * v_prenex_45 <= v_prenex_46 + 577632) && 0 < v_prenex_45 + 43) && !(0 == v_prenex_46 % 5)) && v_prenex_46 + 43 <= 0)) && a29 <= 220) && a3 == 1)) || (138 < a23 && ((a25 == 13 && a8 == 15) && a4 == 1) && a3 == 1)) || (((((a25 == 12 && a4 <= 0) && a23 <= 138) && a3 == 1) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 15 == a8)) || ((((((a4 <= 0 && a23 <= 138) && 15 == a8) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && a3 == 1)) || ((((a8 == 15 && a4 == 1) && (\exists v_prenex_18 : int :: (((0 <= 12 * v_prenex_18 / 10 && 0 <= 12 * v_prenex_18) && 12 * v_prenex_18 / 10 / 5 + 99853 <= a29) && 245 < v_prenex_18) && 0 <= 12 * v_prenex_18 / 10 + 1)) && a25 == 11) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && 312 <= a23) && a4 == 1) && a3 == 1)) || ((((((a4 == 1 && a29 <= 245) && a8 == 15) && 140 < a29) && a23 <= 138) && a25 == 11) && a3 == 1)) || (((((a25 == 12 && a4 == 1) && 15 == a8) && a23 <= 247) && a3 == 1) && 138 < a23)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a3 == 1) && 245 < a29)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 155.9s OverallTime, 25 OverallIterations, 8 TraceHistogramMax, 91.7s AutomataDifference, 0.0s DeadEndRemovalTime, 31.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4975 SDtfs, 17305 SDslu, 2672 SDs, 0 SdLazy, 48937 SolverSat, 6819 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 74.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6251 GetRequests, 6083 SyntacticMatches, 21 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20664occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 49416 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 306 NumberOfFragments, 1459 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1847385 FormulaSimplificationTreeSizeReduction, 6.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1886048 FormulaSimplificationTreeSizeReductionInter, 24.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 16215 NumberOfCodeBlocks, 16215 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 16178 ConstructedInterpolants, 351 QuantifiedInterpolants, 40720777 SizeOfPredicates, 27 NumberOfNonLiveVariables, 7838 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 20438/26020 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...