./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c406f4c881927013bc1c3740a0ccf2226e847a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:18:55,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:18:55,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:18:55,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:18:55,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:18:55,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:18:55,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:18:55,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:18:55,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:18:55,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:18:55,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:18:55,239 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:18:55,240 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:18:55,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:18:55,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:18:55,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:18:55,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:18:55,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:18:55,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:18:55,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:18:55,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:18:55,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:18:55,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:18:55,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:18:55,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:18:55,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:18:55,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:18:55,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:18:55,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:18:55,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:18:55,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:18:55,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:18:55,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:18:55,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:18:55,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:18:55,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:18:55,267 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:18:55,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:18:55,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:18:55,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:18:55,286 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:18:55,286 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:18:55,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:18:55,287 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:18:55,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:18:55,289 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:18:55,289 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:18:55,289 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:18:55,289 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:18:55,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:18:55,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:18:55,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:18:55,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:18:55,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:18:55,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:18:55,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:18:55,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:18:55,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:18:55,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:18:55,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:18:55,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15c406f4c881927013bc1c3740a0ccf2226e847a [2018-12-30 23:18:55,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:18:55,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:18:55,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:18:55,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:18:55,364 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:18:55,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-12-30 23:18:55,444 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0b114e3/48f6c9fda29a470aba03cfac72f5ff3d/FLAG937ccaf7f [2018-12-30 23:18:56,008 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:18:56,009 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-12-30 23:18:56,025 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0b114e3/48f6c9fda29a470aba03cfac72f5ff3d/FLAG937ccaf7f [2018-12-30 23:18:56,228 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0b114e3/48f6c9fda29a470aba03cfac72f5ff3d [2018-12-30 23:18:56,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:18:56,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:18:56,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:18:56,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:18:56,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:18:56,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:18:56" (1/1) ... [2018-12-30 23:18:56,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:56, skipping insertion in model container [2018-12-30 23:18:56,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:18:56" (1/1) ... [2018-12-30 23:18:56,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:18:56,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:18:56,885 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:18:56,895 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:18:57,047 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:18:57,065 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:18:57,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57 WrapperNode [2018-12-30 23:18:57,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:18:57,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:18:57,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:18:57,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:18:57,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:18:57,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:18:57,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:18:57,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:18:57,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... [2018-12-30 23:18:57,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:18:57,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:18:57,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:18:57,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:18:57,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:18:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:18:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:19:00,953 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:19:00,953 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 23:19:00,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:00 BoogieIcfgContainer [2018-12-30 23:19:00,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:19:00,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:19:00,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:19:00,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:19:00,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:18:56" (1/3) ... [2018-12-30 23:19:00,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9f7a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:00, skipping insertion in model container [2018-12-30 23:19:00,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:18:57" (2/3) ... [2018-12-30 23:19:00,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9f7a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:00, skipping insertion in model container [2018-12-30 23:19:00,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:00" (3/3) ... [2018-12-30 23:19:00,965 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label46_true-unreach-call_false-termination.c [2018-12-30 23:19:00,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:19:00,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:19:01,007 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:19:01,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:19:01,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:19:01,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:19:01,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:19:01,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:19:01,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:19:01,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:19:01,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:19:01,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:19:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2018-12-30 23:19:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 23:19:01,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:01,081 INFO L402 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] [2018-12-30 23:19:01,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2018-12-30 23:19:01,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:01,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:01,524 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 23:19:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:19:01,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:01,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:01,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:01,748 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2018-12-30 23:19:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:05,141 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2018-12-30 23:19:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:05,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-12-30 23:19:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:05,168 INFO L225 Difference]: With dead ends: 852 [2018-12-30 23:19:05,169 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 23:19:05,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 23:19:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-30 23:19:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 23:19:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2018-12-30 23:19:05,253 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 39 [2018-12-30 23:19:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:05,254 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2018-12-30 23:19:05,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2018-12-30 23:19:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-30 23:19:05,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:05,264 INFO L402 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, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:05,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1976295897, now seen corresponding path program 1 times [2018-12-30 23:19:05,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:05,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:05,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:05,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-30 23:19:05,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:05,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:05,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:05,565 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2018-12-30 23:19:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:07,606 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2018-12-30 23:19:07,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:07,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-30 23:19:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:07,618 INFO L225 Difference]: With dead ends: 1252 [2018-12-30 23:19:07,619 INFO L226 Difference]: Without dead ends: 894 [2018-12-30 23:19:07,622 INFO L631 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-12-30 23:19:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-30 23:19:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2018-12-30 23:19:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-12-30 23:19:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2018-12-30 23:19:07,684 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 187 [2018-12-30 23:19:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:07,685 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2018-12-30 23:19:07,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2018-12-30 23:19:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-30 23:19:07,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:07,696 INFO L402 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:07,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1989656586, now seen corresponding path program 1 times [2018-12-30 23:19:07,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:07,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:07,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:07,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:07,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:08,272 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 23:19:08,655 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-12-30 23:19:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 140 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-30 23:19:08,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:08,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:08,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:08,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-30 23:19:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 23:19:08,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:08,967 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 6 states. [2018-12-30 23:19:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:14,144 INFO L93 Difference]: Finished difference Result 3446 states and 4804 transitions. [2018-12-30 23:19:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:14,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-12-30 23:19:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:14,163 INFO L225 Difference]: With dead ends: 3446 [2018-12-30 23:19:14,163 INFO L226 Difference]: Without dead ends: 2674 [2018-12-30 23:19:14,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-12-30 23:19:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1962. [2018-12-30 23:19:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2018-12-30 23:19:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2132 transitions. [2018-12-30 23:19:14,223 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2132 transitions. Word has length 210 [2018-12-30 23:19:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:14,224 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2132 transitions. [2018-12-30 23:19:14,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2132 transitions. [2018-12-30 23:19:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-12-30 23:19:14,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:14,241 INFO L402 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-12-30 23:19:14,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash -35270676, now seen corresponding path program 1 times [2018-12-30 23:19:14,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:14,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-12-30 23:19:14,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:14,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:14,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:14,988 INFO L87 Difference]: Start difference. First operand 1962 states and 2132 transitions. Second operand 4 states. [2018-12-30 23:19:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:17,374 INFO L93 Difference]: Finished difference Result 5346 states and 5936 transitions. [2018-12-30 23:19:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:17,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 507 [2018-12-30 23:19:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:17,393 INFO L225 Difference]: With dead ends: 5346 [2018-12-30 23:19:17,393 INFO L226 Difference]: Without dead ends: 3564 [2018-12-30 23:19:17,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2018-12-30 23:19:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2852. [2018-12-30 23:19:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3124 transitions. [2018-12-30 23:19:17,459 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3124 transitions. Word has length 507 [2018-12-30 23:19:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:17,461 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3124 transitions. [2018-12-30 23:19:17,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3124 transitions. [2018-12-30 23:19:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-12-30 23:19:17,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:17,475 INFO L402 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-12-30 23:19:17,475 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 482320211, now seen corresponding path program 1 times [2018-12-30 23:19:17,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:17,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-12-30 23:19:18,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:18,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:18,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:18,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:18,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:18,153 INFO L87 Difference]: Start difference. First operand 2852 states and 3124 transitions. Second operand 4 states. [2018-12-30 23:19:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:19,725 INFO L93 Difference]: Finished difference Result 6414 states and 7097 transitions. [2018-12-30 23:19:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:19,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2018-12-30 23:19:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:19,745 INFO L225 Difference]: With dead ends: 6414 [2018-12-30 23:19:19,745 INFO L226 Difference]: Without dead ends: 3742 [2018-12-30 23:19:19,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2018-12-30 23:19:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2018-12-30 23:19:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2018-12-30 23:19:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3876 transitions. [2018-12-30 23:19:19,822 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3876 transitions. Word has length 526 [2018-12-30 23:19:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:19,823 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3876 transitions. [2018-12-30 23:19:19,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3876 transitions. [2018-12-30 23:19:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-12-30 23:19:19,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:19,841 INFO L402 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, 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, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:19,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2009542813, now seen corresponding path program 1 times [2018-12-30 23:19:19,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:19,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 770 proven. 130 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-12-30 23:19:20,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:20,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:21,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-12-30 23:19:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-12-30 23:19:21,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 23:19:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 23:19:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:19:21,706 INFO L87 Difference]: Start difference. First operand 3564 states and 3876 transitions. Second operand 14 states. [2018-12-30 23:19:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:25,879 INFO L93 Difference]: Finished difference Result 7185 states and 7818 transitions. [2018-12-30 23:19:25,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:19:25,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 528 [2018-12-30 23:19:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:25,896 INFO L225 Difference]: With dead ends: 7185 [2018-12-30 23:19:25,897 INFO L226 Difference]: Without dead ends: 3570 [2018-12-30 23:19:25,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 524 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-12-30 23:19:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2018-12-30 23:19:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2852. [2018-12-30 23:19:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3044 transitions. [2018-12-30 23:19:25,958 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3044 transitions. Word has length 528 [2018-12-30 23:19:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:25,959 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3044 transitions. [2018-12-30 23:19:25,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 23:19:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3044 transitions. [2018-12-30 23:19:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2018-12-30 23:19:25,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:25,969 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:25,969 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1584602280, now seen corresponding path program 1 times [2018-12-30 23:19:25,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-12-30 23:19:26,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:26,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:26,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:26,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:26,531 INFO L87 Difference]: Start difference. First operand 2852 states and 3044 transitions. Second operand 3 states. [2018-12-30 23:19:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:27,112 INFO L93 Difference]: Finished difference Result 6770 states and 7217 transitions. [2018-12-30 23:19:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:27,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2018-12-30 23:19:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:27,135 INFO L225 Difference]: With dead ends: 6770 [2018-12-30 23:19:27,136 INFO L226 Difference]: Without dead ends: 4098 [2018-12-30 23:19:27,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2018-12-30 23:19:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3386. [2018-12-30 23:19:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-30 23:19:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3600 transitions. [2018-12-30 23:19:27,209 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3600 transitions. Word has length 714 [2018-12-30 23:19:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3600 transitions. [2018-12-30 23:19:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3600 transitions. [2018-12-30 23:19:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-12-30 23:19:27,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:27,225 INFO L402 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, 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:27,225 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1269972873, now seen corresponding path program 1 times [2018-12-30 23:19:27,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:27,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:27,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2018-12-30 23:19:27,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:27,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:27,913 INFO L87 Difference]: Start difference. First operand 3386 states and 3600 transitions. Second operand 3 states. [2018-12-30 23:19:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:29,072 INFO L93 Difference]: Finished difference Result 7660 states and 8139 transitions. [2018-12-30 23:19:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:29,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 786 [2018-12-30 23:19:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:29,091 INFO L225 Difference]: With dead ends: 7660 [2018-12-30 23:19:29,091 INFO L226 Difference]: Without dead ends: 4454 [2018-12-30 23:19:29,096 INFO L631 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-12-30 23:19:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2018-12-30 23:19:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2018-12-30 23:19:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:19:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4699 transitions. [2018-12-30 23:19:29,175 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4699 transitions. Word has length 786 [2018-12-30 23:19:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:29,176 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4699 transitions. [2018-12-30 23:19:29,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4699 transitions. [2018-12-30 23:19:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-12-30 23:19:29,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:29,189 INFO L402 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:29,189 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash -928636369, now seen corresponding path program 1 times [2018-12-30 23:19:29,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:29,810 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-30 23:19:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1135 proven. 4 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2018-12-30 23:19:30,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:30,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:30,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:31,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1116 proven. 23 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2018-12-30 23:19:31,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:31,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-12-30 23:19:31,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:31,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:31,888 INFO L87 Difference]: Start difference. First operand 4454 states and 4699 transitions. Second operand 8 states. [2018-12-30 23:19:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:33,946 INFO L93 Difference]: Finished difference Result 10052 states and 10571 transitions. [2018-12-30 23:19:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:33,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 870 [2018-12-30 23:19:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:33,986 INFO L225 Difference]: With dead ends: 10052 [2018-12-30 23:19:33,987 INFO L226 Difference]: Without dead ends: 5778 [2018-12-30 23:19:34,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:19:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-12-30 23:19:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 4454. [2018-12-30 23:19:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:19:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4698 transitions. [2018-12-30 23:19:34,107 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4698 transitions. Word has length 870 [2018-12-30 23:19:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:34,108 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4698 transitions. [2018-12-30 23:19:34,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4698 transitions. [2018-12-30 23:19:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2018-12-30 23:19:34,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:34,122 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:34,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -754416928, now seen corresponding path program 1 times [2018-12-30 23:19:34,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:34,819 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-30 23:19:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1955 proven. 199 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-12-30 23:19:36,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:36,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:36,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:36,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1862 proven. 93 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2018-12-30 23:19:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:38,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:19:38,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:38,333 INFO L87 Difference]: Start difference. First operand 4454 states and 4698 transitions. Second operand 8 states. [2018-12-30 23:19:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:40,412 INFO L93 Difference]: Finished difference Result 10586 states and 11131 transitions. [2018-12-30 23:19:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:40,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 959 [2018-12-30 23:19:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:40,426 INFO L225 Difference]: With dead ends: 10586 [2018-12-30 23:19:40,427 INFO L226 Difference]: Without dead ends: 6312 [2018-12-30 23:19:40,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:19:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2018-12-30 23:19:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 4810. [2018-12-30 23:19:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-12-30 23:19:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5048 transitions. [2018-12-30 23:19:40,514 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5048 transitions. Word has length 959 [2018-12-30 23:19:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:40,515 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 5048 transitions. [2018-12-30 23:19:40,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5048 transitions. [2018-12-30 23:19:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2018-12-30 23:19:40,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:40,530 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:40,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1310024199, now seen corresponding path program 1 times [2018-12-30 23:19:40,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:40,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2189 proven. 0 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2018-12-30 23:19:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:19:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:19:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:41,768 INFO L87 Difference]: Start difference. First operand 4810 states and 5048 transitions. Second operand 5 states. [2018-12-30 23:19:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:43,107 INFO L93 Difference]: Finished difference Result 10864 states and 11381 transitions. [2018-12-30 23:19:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:43,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1036 [2018-12-30 23:19:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:43,118 INFO L225 Difference]: With dead ends: 10864 [2018-12-30 23:19:43,119 INFO L226 Difference]: Without dead ends: 6234 [2018-12-30 23:19:43,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-30 23:19:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2018-12-30 23:19:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5166. [2018-12-30 23:19:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2018-12-30 23:19:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5410 transitions. [2018-12-30 23:19:43,203 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5410 transitions. Word has length 1036 [2018-12-30 23:19:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:43,204 INFO L480 AbstractCegarLoop]: Abstraction has 5166 states and 5410 transitions. [2018-12-30 23:19:43,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:19:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5410 transitions. [2018-12-30 23:19:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1498 [2018-12-30 23:19:43,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:43,231 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:43,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash 674872807, now seen corresponding path program 1 times [2018-12-30 23:19:43,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:43,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:43,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:43,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:43,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:44,195 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 23:19:44,424 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 23:19:44,635 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 23:19:44,946 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-30 23:19:45,254 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-30 23:19:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7083 backedges. 4611 proven. 363 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2018-12-30 23:19:48,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:48,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:48,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:48,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7083 backedges. 4482 proven. 252 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2018-12-30 23:19:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-12-30 23:19:50,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:19:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:19:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:19:50,870 INFO L87 Difference]: Start difference. First operand 5166 states and 5410 transitions. Second operand 12 states. [2018-12-30 23:19:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:53,824 INFO L93 Difference]: Finished difference Result 10580 states and 11075 transitions. [2018-12-30 23:19:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-30 23:19:53,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1497 [2018-12-30 23:19:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:53,836 INFO L225 Difference]: With dead ends: 10580 [2018-12-30 23:19:53,836 INFO L226 Difference]: Without dead ends: 5594 [2018-12-30 23:19:53,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1513 GetRequests, 1496 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-12-30 23:19:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2018-12-30 23:19:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5344. [2018-12-30 23:19:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:19:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5533 transitions. [2018-12-30 23:19:53,935 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5533 transitions. Word has length 1497 [2018-12-30 23:19:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:53,937 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5533 transitions. [2018-12-30 23:19:53,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:19:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5533 transitions. [2018-12-30 23:19:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2018-12-30 23:19:53,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:53,972 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:53,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash 19375012, now seen corresponding path program 1 times [2018-12-30 23:19:53,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:53,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:53,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:53,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:55,204 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 23:19:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 6624 proven. 30 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2018-12-30 23:19:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:57,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:19:57,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:57,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 2962 proven. 0 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2018-12-30 23:19:59,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 23:19:59,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:59,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:59,961 INFO L87 Difference]: Start difference. First operand 5344 states and 5533 transitions. Second operand 7 states. [2018-12-30 23:20:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:02,755 INFO L93 Difference]: Finished difference Result 11398 states and 11792 transitions. [2018-12-30 23:20:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:20:02,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1729 [2018-12-30 23:20:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:02,770 INFO L225 Difference]: With dead ends: 11398 [2018-12-30 23:20:02,770 INFO L226 Difference]: Without dead ends: 6234 [2018-12-30 23:20:02,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1746 GetRequests, 1733 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:20:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2018-12-30 23:20:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5344. [2018-12-30 23:20:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-12-30 23:20:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5527 transitions. [2018-12-30 23:20:02,859 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5527 transitions. Word has length 1729 [2018-12-30 23:20:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:02,861 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5527 transitions. [2018-12-30 23:20:02,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5527 transitions. [2018-12-30 23:20:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1747 [2018-12-30 23:20:02,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:02,891 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:02,893 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1276225934, now seen corresponding path program 1 times [2018-12-30 23:20:02,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:02,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9575 backedges. 3849 proven. 0 refuted. 0 times theorem prover too weak. 5726 trivial. 0 not checked. [2018-12-30 23:20:04,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:04,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:04,805 INFO L87 Difference]: Start difference. First operand 5344 states and 5527 transitions. Second operand 4 states. [2018-12-30 23:20:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:05,962 INFO L93 Difference]: Finished difference Result 11932 states and 12320 transitions. [2018-12-30 23:20:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:05,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1746 [2018-12-30 23:20:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:05,969 INFO L225 Difference]: With dead ends: 11932 [2018-12-30 23:20:05,969 INFO L226 Difference]: Without dead ends: 4276 [2018-12-30 23:20:05,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-12-30 23:20:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2018-12-30 23:20:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-12-30 23:20:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4182 transitions. [2018-12-30 23:20:06,032 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4182 transitions. Word has length 1746 [2018-12-30 23:20:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:06,034 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4182 transitions. [2018-12-30 23:20:06,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4182 transitions. [2018-12-30 23:20:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2018-12-30 23:20:06,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:06,063 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:06,063 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1727618608, now seen corresponding path program 1 times [2018-12-30 23:20:06,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:06,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:06,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 5645 proven. 639 refuted. 0 times theorem prover too weak. 4651 trivial. 0 not checked. [2018-12-30 23:20:08,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:08,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:08,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:08,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:11,436 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2018-12-30 23:20:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 3871 proven. 213 refuted. 0 times theorem prover too weak. 6851 trivial. 0 not checked. [2018-12-30 23:20:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-12-30 23:20:13,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 23:20:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 23:20:13,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:20:13,355 INFO L87 Difference]: Start difference. First operand 4098 states and 4182 transitions. Second operand 10 states. [2018-12-30 23:20:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:22,008 INFO L93 Difference]: Finished difference Result 10152 states and 10409 transitions. [2018-12-30 23:20:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:20:22,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1817 [2018-12-30 23:20:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:22,014 INFO L225 Difference]: With dead ends: 10152 [2018-12-30 23:20:22,015 INFO L226 Difference]: Without dead ends: 4988 [2018-12-30 23:20:22,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1835 GetRequests, 1820 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-30 23:20:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2018-12-30 23:20:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2018-12-30 23:20:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:20:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4531 transitions. [2018-12-30 23:20:22,074 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4531 transitions. Word has length 1817 [2018-12-30 23:20:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:22,075 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4531 transitions. [2018-12-30 23:20:22,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 23:20:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4531 transitions. [2018-12-30 23:20:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1944 [2018-12-30 23:20:22,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:22,101 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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-12-30 23:20:22,101 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1949581878, now seen corresponding path program 1 times [2018-12-30 23:20:22,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:22,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:22,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:22,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:22,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12591 backedges. 7356 proven. 1392 refuted. 0 times theorem prover too weak. 3843 trivial. 0 not checked. [2018-12-30 23:20:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:26,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:27,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12591 backedges. 8748 proven. 0 refuted. 0 times theorem prover too weak. 3843 trivial. 0 not checked. [2018-12-30 23:20:31,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:20:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-12-30 23:20:31,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:20:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:20:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:31,136 INFO L87 Difference]: Start difference. First operand 4454 states and 4531 transitions. Second operand 8 states. [2018-12-30 23:20:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:33,442 INFO L93 Difference]: Finished difference Result 6806 states and 6946 transitions. [2018-12-30 23:20:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:20:33,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1943 [2018-12-30 23:20:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:33,448 INFO L225 Difference]: With dead ends: 6806 [2018-12-30 23:20:33,448 INFO L226 Difference]: Without dead ends: 4490 [2018-12-30 23:20:33,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1951 GetRequests, 1942 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:20:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-30 23:20:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3920. [2018-12-30 23:20:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2018-12-30 23:20:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3978 transitions. [2018-12-30 23:20:33,497 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3978 transitions. Word has length 1943 [2018-12-30 23:20:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:33,499 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3978 transitions. [2018-12-30 23:20:33,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:20:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3978 transitions. [2018-12-30 23:20:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2019 [2018-12-30 23:20:33,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:33,523 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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] [2018-12-30 23:20:33,523 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1233211586, now seen corresponding path program 2 times [2018-12-30 23:20:33,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:33,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:33,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:34,525 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-30 23:20:34,727 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 23:20:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9262 proven. 695 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2018-12-30 23:20:38,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:38,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:38,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-30 23:20:39,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-30 23:20:39,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-30 23:20:39,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9347 proven. 184 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2018-12-30 23:20:43,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:43,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-12-30 23:20:43,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:20:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:20:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:20:43,388 INFO L87 Difference]: Start difference. First operand 3920 states and 3978 transitions. Second operand 9 states. [2018-12-30 23:20:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:45,341 INFO L93 Difference]: Finished difference Result 5940 states and 6043 transitions. [2018-12-30 23:20:45,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:20:45,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2018 [2018-12-30 23:20:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:45,345 INFO L225 Difference]: With dead ends: 5940 [2018-12-30 23:20:45,346 INFO L226 Difference]: Without dead ends: 4158 [2018-12-30 23:20:45,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2027 GetRequests, 2017 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:20:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2018-12-30 23:20:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3920. [2018-12-30 23:20:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2018-12-30 23:20:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3959 transitions. [2018-12-30 23:20:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3959 transitions. Word has length 2018 [2018-12-30 23:20:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:45,398 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3959 transitions. [2018-12-30 23:20:45,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:20:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3959 transitions. [2018-12-30 23:20:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2018-12-30 23:20:45,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:45,427 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 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-12-30 23:20:45,428 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2140269625, now seen corresponding path program 1 times [2018-12-30 23:20:45,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:45,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 23:20:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 4566 proven. 213 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2018-12-30 23:20:47,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:47,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:20:47,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:48,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:51,383 WARN L181 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 36 [2018-12-30 23:20:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 4566 proven. 176 refuted. 37 times theorem prover too weak. 9750 trivial. 0 not checked. [2018-12-30 23:20:53,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:53,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-30 23:20:53,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:20:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:20:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2018-12-30 23:20:53,880 INFO L87 Difference]: Start difference. First operand 3920 states and 3959 transitions. Second operand 6 states. [2018-12-30 23:20:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:59,062 INFO L93 Difference]: Finished difference Result 7302 states and 7378 transitions. [2018-12-30 23:20:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:20:59,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2119 [2018-12-30 23:20:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:59,065 INFO L225 Difference]: With dead ends: 7302 [2018-12-30 23:20:59,065 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:20:59,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2126 GetRequests, 2119 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2018-12-30 23:20:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:20:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:20:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:20:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:20:59,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2119 [2018-12-30 23:20:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:59,071 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:20:59,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:20:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:20:59,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:20:59,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:20:59,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:59,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,043 WARN L181 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 571 DAG size of output: 469 [2018-12-30 23:21:00,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:21:00,775 WARN L181 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 571 DAG size of output: 469 [2018-12-30 23:21:07,266 WARN L181 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 437 DAG size of output: 177 [2018-12-30 23:21:13,052 WARN L181 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 437 DAG size of output: 177 [2018-12-30 23:21:13,067 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-30 23:21:13,068 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-30 23:21:13,069 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-30 23:21:13,070 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-30 23:21:13,076 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-30 23:21:13,076 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,077 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,078 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,081 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-30 23:21:13,082 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-30 23:21:13,083 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,084 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-30 23:21:13,085 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,086 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,087 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-30 23:21:13,093 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-30 23:21:13,094 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-30 23:21:13,099 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,100 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,100 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse14 (= ~a21~0 8))) (let ((.cse34 (+ ~a12~0 43)) (.cse25 (= ~a21~0 10)) (.cse0 (= ~a15~0 7)) (.cse27 (not .cse14)) (.cse9 (<= ~a15~0 8))) (let ((.cse22 (= ~a15~0 8)) (.cse40 (or (and (not .cse0) .cse9) (and .cse27 .cse9))) (.cse6 (= ~a24~0 1)) (.cse29 (not .cse25)) (.cse28 (<= .cse34 0)) (.cse43 (< 11 ~a12~0)) (.cse13 (= ~a15~0 9))) (let ((.cse33 (and .cse25 .cse9)) (.cse31 (or .cse28 .cse43 .cse13)) (.cse18 (and .cse40 .cse6 .cse29)) (.cse30 (= ~a21~0 7)) (.cse39 (or .cse43 (and .cse22 .cse6))) (.cse7 (= ~a15~0 5))) (let ((.cse10 (<= ~a21~0 6)) (.cse17 (not .cse7)) (.cse1 (and .cse39 .cse6 .cse14 .cse9)) (.cse8 (exists ((v_~a12~0_436 Int)) (let ((.cse41 (div (+ v_~a12~0_436 (- 600066)) 5))) (let ((.cse42 (+ (* 34 .cse41) 34))) (and (not (= (mod (+ (* 4 .cse41) 4) 10) 0)) (< .cse42 0) (<= v_~a12~0_436 586307) (not (= 0 (mod (+ v_~a12~0_436 4) 5))) (<= ~a12~0 (+ (div .cse42 10) 1)) (< v_~a12~0_436 600066)))))) (.cse21 (and .cse40 .cse6 .cse30)) (.cse3 (not .cse22)) (.cse19 (= ~a21~0 9)) (.cse26 (<= ~a12~0 599999)) (.cse24 (< 80 ~a12~0)) (.cse20 (and .cse31 (and (and (<= ~a12~0 80) .cse18) .cse39))) (.cse32 (exists ((v_prenex_26 Int)) (let ((.cse38 (div (+ v_prenex_26 (- 600066)) 5))) (let ((.cse37 (* 34 .cse38))) (let ((.cse36 (+ .cse37 34)) (.cse35 (* 4 .cse38))) (and (not (= 0 (mod .cse35 10))) (<= ~a12~0 (+ (div .cse36 10) 1)) (< .cse37 0) (< .cse36 0) (not (= 0 (mod (+ .cse35 4) 10))) (< v_prenex_26 600066) (<= v_prenex_26 599999) (not (= 0 (mod (+ v_prenex_26 4) 5))))))))) (.cse2 (and .cse33 .cse6)) (.cse23 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 11)) (.cse4 (< 0 .cse34)) (.cse5 (= ~a21~0 6)) (.cse11 (<= 95381 ~a12~0)) (.cse12 (<= ~a12~0 586307)) (.cse16 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse9 .cse10) (and .cse5 .cse11 .cse6 .cse12 .cse13) (and .cse0 .cse2) (and .cse6 .cse14 .cse13 .cse15 .cse4) (and .cse6 .cse9 .cse16 .cse10) (and .cse17 .cse3 .cse18) (and (and (not (= ULTIMATE.start_calculate_output_~input 5)) (and .cse18 .cse15) .cse19) .cse17 .cse4) (and .cse3 .cse20) (and (and (and .cse21 .cse15) .cse22) .cse4) (and (and .cse6 .cse14) .cse12 .cse13 .cse23) (and (and (<= ~a12~0 73282) .cse17 .cse1) .cse24) (and (and .cse25 .cse6 .cse13) .cse26 .cse24) (and .cse3 (and (and .cse27 (and .cse28 .cse9) .cse29) .cse6)) (and (not (= ULTIMATE.start_calculate_output_~input 2)) .cse25 .cse6 .cse13 .cse15 .cse4) (and .cse8 .cse6 .cse25 .cse13) (and (and (or .cse30 .cse14) .cse6 .cse13) .cse26 .cse24) (and (and .cse21 .cse31) .cse3) (and (and .cse6 .cse13 .cse19) .cse26 .cse24) (and .cse20 .cse23) (and .cse22 .cse32 .cse25 .cse6) (and .cse0 .cse32 .cse6) (or (and .cse2 .cse23) (and (and .cse6 (and .cse33 .cse15)) .cse4)) (and .cse5 (and .cse6 .cse9) .cse11 .cse12) (and .cse13 (and .cse6 (<= (+ ~a12~0 526767) 0) .cse14)) (and .cse22 .cse16 .cse6 .cse30))))))) [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,101 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-12-30 23:21:13,102 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-30 23:21:13,104 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,105 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-30 23:21:13,108 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse14 (= ~a21~0 8))) (let ((.cse34 (+ ~a12~0 43)) (.cse25 (= ~a21~0 10)) (.cse0 (= ~a15~0 7)) (.cse27 (not .cse14)) (.cse9 (<= ~a15~0 8))) (let ((.cse22 (= ~a15~0 8)) (.cse40 (or (and (not .cse0) .cse9) (and .cse27 .cse9))) (.cse6 (= ~a24~0 1)) (.cse29 (not .cse25)) (.cse28 (<= .cse34 0)) (.cse43 (< 11 ~a12~0)) (.cse13 (= ~a15~0 9))) (let ((.cse33 (and .cse25 .cse9)) (.cse31 (or .cse28 .cse43 .cse13)) (.cse18 (and .cse40 .cse6 .cse29)) (.cse30 (= ~a21~0 7)) (.cse39 (or .cse43 (and .cse22 .cse6))) (.cse7 (= ~a15~0 5))) (let ((.cse10 (<= ~a21~0 6)) (.cse17 (not .cse7)) (.cse1 (and .cse39 .cse6 .cse14 .cse9)) (.cse8 (exists ((v_~a12~0_436 Int)) (let ((.cse41 (div (+ v_~a12~0_436 (- 600066)) 5))) (let ((.cse42 (+ (* 34 .cse41) 34))) (and (not (= (mod (+ (* 4 .cse41) 4) 10) 0)) (< .cse42 0) (<= v_~a12~0_436 586307) (not (= 0 (mod (+ v_~a12~0_436 4) 5))) (<= ~a12~0 (+ (div .cse42 10) 1)) (< v_~a12~0_436 600066)))))) (.cse21 (and .cse40 .cse6 .cse30)) (.cse3 (not .cse22)) (.cse19 (= ~a21~0 9)) (.cse26 (<= ~a12~0 599999)) (.cse24 (< 80 ~a12~0)) (.cse20 (and .cse31 (and (and (<= ~a12~0 80) .cse18) .cse39))) (.cse32 (exists ((v_prenex_26 Int)) (let ((.cse38 (div (+ v_prenex_26 (- 600066)) 5))) (let ((.cse37 (* 34 .cse38))) (let ((.cse36 (+ .cse37 34)) (.cse35 (* 4 .cse38))) (and (not (= 0 (mod .cse35 10))) (<= ~a12~0 (+ (div .cse36 10) 1)) (< .cse37 0) (< .cse36 0) (not (= 0 (mod (+ .cse35 4) 10))) (< v_prenex_26 600066) (<= v_prenex_26 599999) (not (= 0 (mod (+ v_prenex_26 4) 5))))))))) (.cse2 (and .cse33 .cse6)) (.cse23 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 11)) (.cse4 (< 0 .cse34)) (.cse5 (= ~a21~0 6)) (.cse11 (<= 95381 ~a12~0)) (.cse12 (<= ~a12~0 586307)) (.cse16 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse9 .cse10) (and .cse5 .cse11 .cse6 .cse12 .cse13) (and .cse0 .cse2) (and .cse6 .cse14 .cse13 .cse15 .cse4) (and .cse6 .cse9 .cse16 .cse10) (and .cse17 .cse3 .cse18) (and (and (not (= ULTIMATE.start_calculate_output_~input 5)) (and .cse18 .cse15) .cse19) .cse17 .cse4) (and .cse3 .cse20) (and (and (and .cse21 .cse15) .cse22) .cse4) (and (and .cse6 .cse14) .cse12 .cse13 .cse23) (and (and (<= ~a12~0 73282) .cse17 .cse1) .cse24) (and (and .cse25 .cse6 .cse13) .cse26 .cse24) (and .cse3 (and (and .cse27 (and .cse28 .cse9) .cse29) .cse6)) (and (not (= ULTIMATE.start_calculate_output_~input 2)) .cse25 .cse6 .cse13 .cse15 .cse4) (and .cse8 .cse6 .cse25 .cse13) (and (and (or .cse30 .cse14) .cse6 .cse13) .cse26 .cse24) (and (and .cse21 .cse31) .cse3) (and (and .cse6 .cse13 .cse19) .cse26 .cse24) (and .cse20 .cse23) (and .cse22 .cse32 .cse25 .cse6) (and .cse0 .cse32 .cse6) (or (and .cse2 .cse23) (and (and .cse6 (and .cse33 .cse15)) .cse4)) (and .cse5 (and .cse6 .cse9) .cse11 .cse12) (and .cse13 (and .cse6 (<= (+ ~a12~0 526767) 0) .cse14)) (and .cse22 .cse16 .cse6 .cse30))))))) [2018-12-30 23:21:13,108 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-30 23:21:13,108 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-30 23:21:13,109 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-30 23:21:13,110 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-30 23:21:13,111 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,113 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,114 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:21:13,115 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-30 23:21:13,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:21:13 BoogieIcfgContainer [2018-12-30 23:21:13,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:21:13,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:21:13,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:21:13,262 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:21:13,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:00" (3/4) ... [2018-12-30 23:21:13,271 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:21:13,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 23:21:13,311 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:21:13,356 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) [2018-12-30 23:21:13,360 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) [2018-12-30 23:21:13,518 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:21:13,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:21:13,519 INFO L168 Benchmark]: Toolchain (without parser) took 137286.00 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 946.0 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,521 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:21:13,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,523 INFO L168 Benchmark]: Boogie Preprocessor took 117.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,523 INFO L168 Benchmark]: RCFGBuilder took 3551.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,523 INFO L168 Benchmark]: TraceAbstraction took 132305.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 992.1 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-30 23:21:13,525 INFO L168 Benchmark]: Witness Printer took 256.24 ms. Allocated memory is still 5.1 GB. Free memory is still 3.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:21:13,529 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 830.02 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 218.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3551.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 132305.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 992.1 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 256.24 ms. Allocated memory is still 5.1 GB. Free memory is still 3.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 880]: Loop Invariant [2018-12-30 23:21:13,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,537 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) - InvariantResult [Line: 20]: Loop Invariant [2018-12-30 23:21:13,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,577 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2018-12-30 23:21:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-12-30 23:21:13,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 132.0s OverallTime, 18 OverallIterations, 18 TraceHistogramMax, 51.3s AutomataDifference, 0.0s DeadEndRemovalTime, 13.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 787 SDtfs, 8488 SDslu, 515 SDs, 0 SdLazy, 32224 SolverSat, 2588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13840 GetRequests, 13702 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=12, 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 9586 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 1887 HoareAnnotationTreeSize, 3 FomulaSimplifications, 738992 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 909482 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 32921 NumberOfCodeBlocks, 32921 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 32893 ConstructedInterpolants, 74 QuantifiedInterpolants, 179986013 SizeOfPredicates, 23 NumberOfNonLiveVariables, 16648 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 163922/168569 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...