./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label54.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer --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 48edbfa8959379fa18549d69e0d1320a333e10c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:30:09,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:30:09,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:30:09,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:30:09,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:30:09,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:30:09,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:30:09,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:30:09,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:30:09,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:30:09,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:30:09,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:30:09,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:30:09,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:30:09,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:30:09,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:30:09,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:30:09,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:30:09,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:30:09,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:30:09,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:30:09,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:30:09,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:30:09,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:30:09,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:30:09,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:30:09,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:30:09,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:30:09,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:30:09,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:30:09,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:30:09,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:30:09,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:30:09,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:30:09,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:30:09,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:30:09,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:30:09,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:30:09,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:30:09,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:30:09,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:30:09,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:30:09,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:30:09,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:30:09,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:30:09,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:30:09,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:30:09,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:30:09,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:30:09,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:30:09,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:30:09,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:30:09,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:30:09,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:30:09,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:30:09,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:30:09,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:30:09,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:30:09,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:30:09,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:30:09,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:30:09,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:30:09,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:30:09,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:30:09,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:30:09,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:30:09,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:30:09,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:30:09,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:30:09,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:30:09,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer 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 -> 48edbfa8959379fa18549d69e0d1320a333e10c1 [2019-11-15 22:30:09,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:30:09,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:30:09,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:30:09,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:30:09,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:30:09,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2019-11-15 22:30:09,377 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/data/06bdfdeb6/d078e750aa1747c8a1c827794be1bac8/FLAGd247b1f2c [2019-11-15 22:30:09,922 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:30:09,924 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2019-11-15 22:30:09,937 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/data/06bdfdeb6/d078e750aa1747c8a1c827794be1bac8/FLAGd247b1f2c [2019-11-15 22:30:10,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/data/06bdfdeb6/d078e750aa1747c8a1c827794be1bac8 [2019-11-15 22:30:10,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:30:10,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:30:10,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:10,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:30:10,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:30:10,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:10" (1/1) ... [2019-11-15 22:30:10,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d1403c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:10, skipping insertion in model container [2019-11-15 22:30:10,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:10" (1/1) ... [2019-11-15 22:30:10,130 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:30:10,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:30:10,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:10,765 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:30:11,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:11,037 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:30:11,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11 WrapperNode [2019-11-15 22:30:11,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:11,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:11,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:30:11,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:30:11,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:11,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:30:11,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:30:11,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:30:11,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... [2019-11-15 22:30:11,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:30:11,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:30:11,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:30:11,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:30:11,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:30:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:30:11,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:30:13,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:30:13,464 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:30:13,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:13 BoogieIcfgContainer [2019-11-15 22:30:13,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:30:13,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:30:13,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:30:13,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:30:13,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:30:10" (1/3) ... [2019-11-15 22:30:13,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3148f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:30:13, skipping insertion in model container [2019-11-15 22:30:13,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:11" (2/3) ... [2019-11-15 22:30:13,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3148f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:30:13, skipping insertion in model container [2019-11-15 22:30:13,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:13" (3/3) ... [2019-11-15 22:30:13,474 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2019-11-15 22:30:13,488 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:30:13,498 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:30:13,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:30:13,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:30:13,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:30:13,558 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:30:13,558 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:30:13,558 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:30:13,558 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:30:13,559 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:30:13,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:30:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 22:30:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:30:13,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:13,601 INFO L380 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] [2019-11-15 22:30:13,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-11-15 22:30:13,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:13,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199209856] [2019-11-15 22:30:13,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:13,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:13,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:13,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199209856] [2019-11-15 22:30:13,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:13,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:30:13,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905259629] [2019-11-15 22:30:13,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:13,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:14,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:14,003 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 22:30:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:16,469 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-11-15 22:30:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:16,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 22:30:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:16,503 INFO L225 Difference]: With dead ends: 951 [2019-11-15 22:30:16,505 INFO L226 Difference]: Without dead ends: 600 [2019-11-15 22:30:16,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-15 22:30:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-11-15 22:30:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 22:30:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-11-15 22:30:16,629 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 37 [2019-11-15 22:30:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:16,629 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-11-15 22:30:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-11-15 22:30:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:30:16,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:16,638 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:16,638 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1017074320, now seen corresponding path program 1 times [2019-11-15 22:30:16,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:16,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864651654] [2019-11-15 22:30:16,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:16,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:16,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:16,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864651654] [2019-11-15 22:30:16,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:16,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:30:16,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821674695] [2019-11-15 22:30:16,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:16,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:16,874 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-11-15 22:30:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:18,444 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-11-15 22:30:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:18,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-15 22:30:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:18,450 INFO L225 Difference]: With dead ends: 1572 [2019-11-15 22:30:18,451 INFO L226 Difference]: Without dead ends: 1164 [2019-11-15 22:30:18,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-11-15 22:30:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-11-15 22:30:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-15 22:30:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1568 transitions. [2019-11-15 22:30:18,500 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1568 transitions. Word has length 105 [2019-11-15 22:30:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:18,501 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1568 transitions. [2019-11-15 22:30:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1568 transitions. [2019-11-15 22:30:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 22:30:18,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:18,504 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:18,504 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash -815400060, now seen corresponding path program 1 times [2019-11-15 22:30:18,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:18,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283615787] [2019-11-15 22:30:18,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:18,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283615787] [2019-11-15 22:30:18,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:18,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:30:18,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790794295] [2019-11-15 22:30:18,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:18,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:18,756 INFO L87 Difference]: Start difference. First operand 1150 states and 1568 transitions. Second operand 4 states. [2019-11-15 22:30:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:20,318 INFO L93 Difference]: Finished difference Result 3966 states and 5431 transitions. [2019-11-15 22:30:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:20,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 22:30:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:20,334 INFO L225 Difference]: With dead ends: 3966 [2019-11-15 22:30:20,334 INFO L226 Difference]: Without dead ends: 2818 [2019-11-15 22:30:20,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-15 22:30:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-11-15 22:30:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-11-15 22:30:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2822 transitions. [2019-11-15 22:30:20,412 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2822 transitions. Word has length 113 [2019-11-15 22:30:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:20,413 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2822 transitions. [2019-11-15 22:30:20,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2822 transitions. [2019-11-15 22:30:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:30:20,416 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:20,416 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:20,416 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1041606763, now seen corresponding path program 1 times [2019-11-15 22:30:20,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:20,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991780980] [2019-11-15 22:30:20,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:20,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991780980] [2019-11-15 22:30:20,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:20,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:30:20,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348023086] [2019-11-15 22:30:20,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:30:20,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:30:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:30:20,659 INFO L87 Difference]: Start difference. First operand 2255 states and 2822 transitions. Second operand 5 states. [2019-11-15 22:30:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:22,616 INFO L93 Difference]: Finished difference Result 7660 states and 9974 transitions. [2019-11-15 22:30:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:30:22,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-11-15 22:30:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:22,646 INFO L225 Difference]: With dead ends: 7660 [2019-11-15 22:30:22,646 INFO L226 Difference]: Without dead ends: 5591 [2019-11-15 22:30:22,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:30:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-11-15 22:30:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5590. [2019-11-15 22:30:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-11-15 22:30:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7031 transitions. [2019-11-15 22:30:22,781 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7031 transitions. Word has length 164 [2019-11-15 22:30:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:22,783 INFO L462 AbstractCegarLoop]: Abstraction has 5590 states and 7031 transitions. [2019-11-15 22:30:22,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:30:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7031 transitions. [2019-11-15 22:30:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 22:30:22,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:22,790 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:22,790 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1265356488, now seen corresponding path program 1 times [2019-11-15 22:30:22,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:22,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463057159] [2019-11-15 22:30:22,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:22,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:23,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463057159] [2019-11-15 22:30:23,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:23,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:30:23,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244325990] [2019-11-15 22:30:23,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:23,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:23,216 INFO L87 Difference]: Start difference. First operand 5590 states and 7031 transitions. Second operand 4 states. [2019-11-15 22:30:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:24,539 INFO L93 Difference]: Finished difference Result 13956 states and 17807 transitions. [2019-11-15 22:30:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:24,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-11-15 22:30:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:24,584 INFO L225 Difference]: With dead ends: 13956 [2019-11-15 22:30:24,585 INFO L226 Difference]: Without dead ends: 8552 [2019-11-15 22:30:24,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8552 states. [2019-11-15 22:30:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8552 to 8166. [2019-11-15 22:30:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2019-11-15 22:30:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 10171 transitions. [2019-11-15 22:30:24,773 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 10171 transitions. Word has length 241 [2019-11-15 22:30:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:24,774 INFO L462 AbstractCegarLoop]: Abstraction has 8166 states and 10171 transitions. [2019-11-15 22:30:24,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 10171 transitions. [2019-11-15 22:30:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-15 22:30:24,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:24,781 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:30:24,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1645985453, now seen corresponding path program 1 times [2019-11-15 22:30:24,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:24,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516767541] [2019-11-15 22:30:24,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:24,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:24,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 22:30:25,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516767541] [2019-11-15 22:30:25,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:25,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:30:25,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156481283] [2019-11-15 22:30:25,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:25,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:25,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:25,049 INFO L87 Difference]: Start difference. First operand 8166 states and 10171 transitions. Second operand 4 states. [2019-11-15 22:30:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:26,873 INFO L93 Difference]: Finished difference Result 16351 states and 20392 transitions. [2019-11-15 22:30:26,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:26,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-11-15 22:30:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:26,939 INFO L225 Difference]: With dead ends: 16351 [2019-11-15 22:30:26,940 INFO L226 Difference]: Without dead ends: 8371 [2019-11-15 22:30:26,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2019-11-15 22:30:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8165. [2019-11-15 22:30:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8165 states. [2019-11-15 22:30:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 9878 transitions. [2019-11-15 22:30:27,111 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 9878 transitions. Word has length 246 [2019-11-15 22:30:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:27,112 INFO L462 AbstractCegarLoop]: Abstraction has 8165 states and 9878 transitions. [2019-11-15 22:30:27,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 9878 transitions. [2019-11-15 22:30:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-15 22:30:27,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:27,120 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:27,121 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1892161860, now seen corresponding path program 1 times [2019-11-15 22:30:27,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:27,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377822764] [2019-11-15 22:30:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:27,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 22:30:27,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377822764] [2019-11-15 22:30:27,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:27,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:30:27,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417484695] [2019-11-15 22:30:27,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:27,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:27,319 INFO L87 Difference]: Start difference. First operand 8165 states and 9878 transitions. Second operand 4 states. [2019-11-15 22:30:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:28,886 INFO L93 Difference]: Finished difference Result 20378 states and 24734 transitions. [2019-11-15 22:30:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:28,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2019-11-15 22:30:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:28,911 INFO L225 Difference]: With dead ends: 20378 [2019-11-15 22:30:28,911 INFO L226 Difference]: Without dead ends: 12399 [2019-11-15 22:30:28,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:30:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2019-11-15 22:30:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 10921. [2019-11-15 22:30:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10921 states. [2019-11-15 22:30:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 13172 transitions. [2019-11-15 22:30:29,098 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 13172 transitions. Word has length 272 [2019-11-15 22:30:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:29,098 INFO L462 AbstractCegarLoop]: Abstraction has 10921 states and 13172 transitions. [2019-11-15 22:30:29,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 13172 transitions. [2019-11-15 22:30:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-11-15 22:30:29,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:29,122 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:29,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1148105623, now seen corresponding path program 1 times [2019-11-15 22:30:29,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:29,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298558882] [2019-11-15 22:30:29,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 136 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:29,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298558882] [2019-11-15 22:30:29,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672360445] [2019-11-15 22:30:29,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:30,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:30:30,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 35 proven. 285 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 22:30:30,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:30:30,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-11-15 22:30:30,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200063004] [2019-11-15 22:30:30,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:30:30,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:30:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:30:30,904 INFO L87 Difference]: Start difference. First operand 10921 states and 13172 transitions. Second operand 12 states. [2019-11-15 22:30:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:42,628 INFO L93 Difference]: Finished difference Result 43086 states and 51215 transitions. [2019-11-15 22:30:42,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:30:42,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 394 [2019-11-15 22:30:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:42,691 INFO L225 Difference]: With dead ends: 43086 [2019-11-15 22:30:42,691 INFO L226 Difference]: Without dead ends: 32351 [2019-11-15 22:30:42,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:30:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32351 states. [2019-11-15 22:30:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32351 to 15529. [2019-11-15 22:30:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-11-15 22:30:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 17980 transitions. [2019-11-15 22:30:43,113 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 17980 transitions. Word has length 394 [2019-11-15 22:30:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:43,114 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 17980 transitions. [2019-11-15 22:30:43,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:30:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 17980 transitions. [2019-11-15 22:30:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-11-15 22:30:43,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:43,158 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:30:43,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:43,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2045648268, now seen corresponding path program 1 times [2019-11-15 22:30:43,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:43,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114799427] [2019-11-15 22:30:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:43,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:43,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 517 proven. 142 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:30:44,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114799427] [2019-11-15 22:30:44,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198360139] [2019-11-15 22:30:44,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:30:44,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:30:45,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:30:45,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 22:30:45,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284344759] [2019-11-15 22:30:45,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:45,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:45,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:30:45,176 INFO L87 Difference]: Start difference. First operand 15529 states and 17980 transitions. Second operand 4 states. [2019-11-15 22:30:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:46,399 INFO L93 Difference]: Finished difference Result 32716 states and 37886 transitions. [2019-11-15 22:30:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:46,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 566 [2019-11-15 22:30:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:46,432 INFO L225 Difference]: With dead ends: 32716 [2019-11-15 22:30:46,432 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 22:30:46,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:30:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 22:30:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 12023. [2019-11-15 22:30:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12023 states. [2019-11-15 22:30:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12023 states to 12023 states and 13204 transitions. [2019-11-15 22:30:46,724 INFO L78 Accepts]: Start accepts. Automaton has 12023 states and 13204 transitions. Word has length 566 [2019-11-15 22:30:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:46,725 INFO L462 AbstractCegarLoop]: Abstraction has 12023 states and 13204 transitions. [2019-11-15 22:30:46,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 12023 states and 13204 transitions. [2019-11-15 22:30:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-11-15 22:30:46,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:46,756 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:30:46,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:46,969 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1988878082, now seen corresponding path program 1 times [2019-11-15 22:30:46,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:46,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177645917] [2019-11-15 22:30:46,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:46,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:46,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 580 proven. 97 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:30:48,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177645917] [2019-11-15 22:30:48,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322231631] [2019-11-15 22:30:48,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:48,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:30:48,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:30:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 667 proven. 10 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 22:30:49,574 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:30:49,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-15 22:30:49,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633922908] [2019-11-15 22:30:49,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:30:49,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:30:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:30:49,576 INFO L87 Difference]: Start difference. First operand 12023 states and 13204 transitions. Second operand 10 states. [2019-11-15 22:30:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:52,739 INFO L93 Difference]: Finished difference Result 25896 states and 28373 transitions. [2019-11-15 22:30:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:30:52,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 590 [2019-11-15 22:30:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:52,756 INFO L225 Difference]: With dead ends: 25896 [2019-11-15 22:30:52,757 INFO L226 Difference]: Without dead ends: 14059 [2019-11-15 22:30:52,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:30:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14059 states. [2019-11-15 22:30:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14059 to 12200. [2019-11-15 22:30:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12200 states. [2019-11-15 22:30:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 13372 transitions. [2019-11-15 22:30:52,935 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 13372 transitions. Word has length 590 [2019-11-15 22:30:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:52,936 INFO L462 AbstractCegarLoop]: Abstraction has 12200 states and 13372 transitions. [2019-11-15 22:30:52,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:30:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 13372 transitions. [2019-11-15 22:30:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-11-15 22:30:52,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:52,971 INFO L380 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:53,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:53,175 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash -696501809, now seen corresponding path program 1 times [2019-11-15 22:30:53,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:53,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109880603] [2019-11-15 22:30:53,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:53,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:53,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 157 proven. 922 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-15 22:30:54,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109880603] [2019-11-15 22:30:54,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815139164] [2019-11-15 22:30:54,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:54,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:30:54,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:54,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:54,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-11-15 22:30:54,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:30:54,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-11-15 22:30:54,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759111095] [2019-11-15 22:30:54,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:30:54,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:30:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:30:54,958 INFO L87 Difference]: Start difference. First operand 12200 states and 13372 transitions. Second operand 4 states. [2019-11-15 22:30:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:56,626 INFO L93 Difference]: Finished difference Result 30851 states and 33772 transitions. [2019-11-15 22:30:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:30:56,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 638 [2019-11-15 22:30:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:30:56,652 INFO L225 Difference]: With dead ends: 30851 [2019-11-15 22:30:56,652 INFO L226 Difference]: Without dead ends: 18836 [2019-11-15 22:30:56,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:30:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18836 states. [2019-11-15 22:30:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18836 to 17171. [2019-11-15 22:30:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17171 states. [2019-11-15 22:30:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17171 states to 17171 states and 18475 transitions. [2019-11-15 22:30:56,908 INFO L78 Accepts]: Start accepts. Automaton has 17171 states and 18475 transitions. Word has length 638 [2019-11-15 22:30:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:30:56,909 INFO L462 AbstractCegarLoop]: Abstraction has 17171 states and 18475 transitions. [2019-11-15 22:30:56,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:30:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17171 states and 18475 transitions. [2019-11-15 22:30:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-11-15 22:30:56,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:30:56,941 INFO L380 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:57,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:57,153 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:30:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1910645706, now seen corresponding path program 1 times [2019-11-15 22:30:57,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:57,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353891322] [2019-11-15 22:30:57,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:57,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:57,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 288 proven. 734 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-15 22:30:58,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353891322] [2019-11-15 22:30:58,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52945463] [2019-11-15 22:30:58,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:58,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:30:58,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:58,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:30:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 288 proven. 734 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-15 22:30:59,416 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:30:59,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-15 22:30:59,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980745038] [2019-11-15 22:30:59,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:30:59,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:30:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:30:59,419 INFO L87 Difference]: Start difference. First operand 17171 states and 18475 transitions. Second operand 12 states. [2019-11-15 22:31:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:31:07,442 INFO L93 Difference]: Finished difference Result 49649 states and 53524 transitions. [2019-11-15 22:31:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:31:07,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 648 [2019-11-15 22:31:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:31:07,443 INFO L225 Difference]: With dead ends: 49649 [2019-11-15 22:31:07,444 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:31:07,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:31:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:31:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:31:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:31:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:31:07,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 648 [2019-11-15 22:31:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:31:07,465 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:31:07,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:31:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:31:07,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:31:07,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:31:07,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:31:09,923 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 763 DAG size of output: 622 [2019-11-15 22:31:11,765 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 763 DAG size of output: 622 [2019-11-15 22:31:17,178 WARN L191 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 608 DAG size of output: 108 [2019-11-15 22:31:21,909 WARN L191 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 608 DAG size of output: 108 [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 22:31:21,911 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,911 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,912 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,913 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse6 (= ~a25~0 13))) (let ((.cse1 (= 10 ~a25~0)) (.cse19 (not .cse6))) (let ((.cse11 (exists ((v_~a23~0_472 Int)) (and (<= 0 v_~a23~0_472) (<= ~a23~0 (+ (mod v_~a23~0_472 299846) 300154)) (<= 312 v_~a23~0_472)))) (.cse4 (exists ((v_~a23~0_475 Int)) (and (< 306 v_~a23~0_475) (<= 0 v_~a23~0_475) (<= ~a23~0 (+ (mod v_~a23~0_475 299846) 300155))))) (.cse3 (<= 260 ~a29~0)) (.cse18 (and .cse19 (<= ~a29~0 140))) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse16 (<= ~a23~0 312)) (.cse14 (< 0 (+ ~a23~0 43))) (.cse5 (= ~a4~0 1)) (.cse12 (= 12 ~a25~0)) (.cse15 (<= ~a23~0 138)) (.cse20 (not (= ~a25~0 9))) (.cse21 (not .cse1)) (.cse10 (< 306 ~a23~0)) (.cse22 (<= ~a29~0 277)) (.cse7 (<= ~a29~0 276)) (.cse17 (<= ~a25~0 9)) (.cse8 (<= ~a23~0 599941)) (.cse9 (= 1 ~a4~0)) (.cse13 (<= 130 ~a29~0))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse0 (and .cse10 .cse11 .cse1) .cse2 .cse9) (and (and .cse6 .cse10 .cse11) .cse9) (and .cse12 .cse0 .cse8 .cse2 .cse9) (and .cse4 .cse13 (and .cse0 .cse10 .cse2 .cse9)) (and .cse14 .cse15) (and .cse16 .cse17 .cse9 .cse18) (and .cse19 .cse15 .cse3) (and .cse15 .cse18) (and (and (and .cse20 .cse14 .cse21) .cse0 .cse2) .cse5 (<= ~a23~0 306)) (and (and .cse6 .cse16 .cse14) .cse5) (and .cse6 .cse7 .cse15 .cse13) (and .cse12 .cse15) (and (and .cse20 (and (<= ~a29~0 130) .cse21) .cse8 (<= 312 ~a23~0)) .cse9) (and .cse7 .cse9 (<= (+ ~a23~0 271) 0)) (and (or (and (and .cse10 .cse8 .cse1 .cse22) .cse9) (and .cse7 .cse8 .cse1 .cse9)) .cse13) (and (or (and (and .cse10 .cse8 .cse22) .cse17 .cse9) (and .cse7 .cse17 .cse8 .cse9)) .cse13))))) [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:31:21,914 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 22:31:21,915 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 22:31:21,916 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:31:21,917 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,918 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,919 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,920 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 22:31:21,921 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,922 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,923 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:31:21,924 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,925 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:31:21,926 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 22:31:21,927 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,928 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 22:31:21,929 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 22:31:21,930 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,931 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 22:31:21,932 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,933 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,934 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,935 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,935 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse6 (= ~a25~0 13))) (let ((.cse1 (= 10 ~a25~0)) (.cse19 (not .cse6))) (let ((.cse11 (exists ((v_~a23~0_472 Int)) (and (<= 0 v_~a23~0_472) (<= ~a23~0 (+ (mod v_~a23~0_472 299846) 300154)) (<= 312 v_~a23~0_472)))) (.cse4 (exists ((v_~a23~0_475 Int)) (and (< 306 v_~a23~0_475) (<= 0 v_~a23~0_475) (<= ~a23~0 (+ (mod v_~a23~0_475 299846) 300155))))) (.cse3 (<= 260 ~a29~0)) (.cse18 (and .cse19 (<= ~a29~0 140))) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse16 (<= ~a23~0 312)) (.cse14 (< 0 (+ ~a23~0 43))) (.cse5 (= ~a4~0 1)) (.cse12 (= 12 ~a25~0)) (.cse15 (<= ~a23~0 138)) (.cse20 (not (= ~a25~0 9))) (.cse21 (not .cse1)) (.cse10 (< 306 ~a23~0)) (.cse22 (<= ~a29~0 277)) (.cse7 (<= ~a29~0 276)) (.cse17 (<= ~a25~0 9)) (.cse8 (<= ~a23~0 599941)) (.cse9 (= 1 ~a4~0)) (.cse13 (<= 130 ~a29~0))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse0 (and .cse10 .cse11 .cse1) .cse2 .cse9) (and (and .cse6 .cse10 .cse11) .cse9) (and .cse12 .cse0 .cse8 .cse2 .cse9) (and .cse4 .cse13 (and .cse0 .cse10 .cse2 .cse9)) (and .cse14 .cse15) (and .cse16 .cse17 .cse9 .cse18) (and .cse19 .cse15 .cse3) (and .cse15 .cse18) (and (and (and .cse20 .cse14 .cse21) .cse0 .cse2) .cse5 (<= ~a23~0 306)) (and (and .cse6 .cse16 .cse14) .cse5) (and .cse6 .cse7 .cse15 .cse13) (and .cse12 .cse15) (and (and .cse20 (and (<= ~a29~0 130) .cse21) .cse8 (<= 312 ~a23~0)) .cse9) (and .cse7 .cse9 (<= (+ ~a23~0 271) 0)) (and (or (and (and .cse10 .cse8 .cse1 .cse22) .cse9) (and .cse7 .cse8 .cse1 .cse9)) .cse13) (and (or (and (and .cse10 .cse8 .cse22) .cse17 .cse9) (and .cse7 .cse17 .cse8 .cse9)) .cse13))))) [2019-11-15 22:31:21,935 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,935 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,936 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:31:21,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:21,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:31:21 BoogieIcfgContainer [2019-11-15 22:31:21,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:31:21,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:31:21,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:31:21,992 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:31:21,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:13" (3/4) ... [2019-11-15 22:31:22,003 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:31:22,032 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:31:22,034 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:31:22,064 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((1 == a3 && 10 == a25) && 15 == a8) && 260 <= a29) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && a4 == 1) || (((a25 == 13 && a29 <= 276) && a23 <= 599941) && 1 == a4)) || (((1 == a3 && (306 < a23 && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 10 == a25) && 15 == a8) && 1 == a4)) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((12 == a25 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || (((\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155) && 130 <= a29) && ((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4)) || (0 < a23 + 43 && a23 <= 138)) || (((a23 <= 312 && a25 <= 9) && 1 == a4) && !(a25 == 13) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (a23 <= 138 && !(a25 == 13) && a29 <= 140)) || ((((((!(a25 == 9) && 0 < a23 + 43) && !(10 == a25)) && 1 == a3) && 15 == a8) && a4 == 1) && a23 <= 306)) || (((a25 == 13 && a23 <= 312) && 0 < a23 + 43) && a4 == 1)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29)) || (12 == a25 && a23 <= 138)) || ((((!(a25 == 9) && a29 <= 130 && !(10 == a25)) && a23 <= 599941) && 312 <= a23) && 1 == a4)) || ((a29 <= 276 && 1 == a4) && a23 + 271 <= 0)) || ((((((306 < a23 && a23 <= 599941) && 10 == a25) && a29 <= 277) && 1 == a4) || (((a29 <= 276 && a23 <= 599941) && 10 == a25) && 1 == a4)) && 130 <= a29)) || ((((((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 <= 9) && 1 == a4) || (((a29 <= 276 && a25 <= 9) && a23 <= 599941) && 1 == a4)) && 130 <= a29) [2019-11-15 22:31:22,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((1 == a3 && 10 == a25) && 15 == a8) && 260 <= a29) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && a4 == 1) || (((a25 == 13 && a29 <= 276) && a23 <= 599941) && 1 == a4)) || (((1 == a3 && (306 < a23 && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 10 == a25) && 15 == a8) && 1 == a4)) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((12 == a25 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || (((\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155) && 130 <= a29) && ((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4)) || (0 < a23 + 43 && a23 <= 138)) || (((a23 <= 312 && a25 <= 9) && 1 == a4) && !(a25 == 13) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (a23 <= 138 && !(a25 == 13) && a29 <= 140)) || ((((((!(a25 == 9) && 0 < a23 + 43) && !(10 == a25)) && 1 == a3) && 15 == a8) && a4 == 1) && a23 <= 306)) || (((a25 == 13 && a23 <= 312) && 0 < a23 + 43) && a4 == 1)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29)) || (12 == a25 && a23 <= 138)) || ((((!(a25 == 9) && a29 <= 130 && !(10 == a25)) && a23 <= 599941) && 312 <= a23) && 1 == a4)) || ((a29 <= 276 && 1 == a4) && a23 + 271 <= 0)) || ((((((306 < a23 && a23 <= 599941) && 10 == a25) && a29 <= 277) && 1 == a4) || (((a29 <= 276 && a23 <= 599941) && 10 == a25) && 1 == a4)) && 130 <= a29)) || ((((((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 <= 9) && 1 == a4) || (((a29 <= 276 && a25 <= 9) && a23 <= 599941) && 1 == a4)) && 130 <= a29) [2019-11-15 22:31:22,207 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7710e976-70e0-4e3d-b980-45d1d863d804/bin/uautomizer/witness.graphml [2019-11-15 22:31:22,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:31:22,209 INFO L168 Benchmark]: Toolchain (without parser) took 72104.12 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -482.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,209 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:31:22,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 932.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,210 INFO L168 Benchmark]: Boogie Preprocessor took 130.10 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,211 INFO L168 Benchmark]: RCFGBuilder took 2143.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.2 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,211 INFO L168 Benchmark]: TraceAbstraction took 68524.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 948.2 MB in the beginning and 1.5 GB in the end (delta: -527.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,211 INFO L168 Benchmark]: Witness Printer took 215.71 ms. Allocated memory is still 3.0 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:31:22,213 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 932.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -213.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 152.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.10 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2143.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.2 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68524.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 948.2 MB in the beginning and 1.5 GB in the end (delta: -527.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 215.71 ms. Allocated memory is still 3.0 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 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_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 22:31:22,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((1 == a3 && 10 == a25) && 15 == a8) && 260 <= a29) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && a4 == 1) || (((a25 == 13 && a29 <= 276) && a23 <= 599941) && 1 == a4)) || (((1 == a3 && (306 < a23 && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 10 == a25) && 15 == a8) && 1 == a4)) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((12 == a25 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || (((\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155) && 130 <= a29) && ((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4)) || (0 < a23 + 43 && a23 <= 138)) || (((a23 <= 312 && a25 <= 9) && 1 == a4) && !(a25 == 13) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (a23 <= 138 && !(a25 == 13) && a29 <= 140)) || ((((((!(a25 == 9) && 0 < a23 + 43) && !(10 == a25)) && 1 == a3) && 15 == a8) && a4 == 1) && a23 <= 306)) || (((a25 == 13 && a23 <= 312) && 0 < a23 + 43) && a4 == 1)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29)) || (12 == a25 && a23 <= 138)) || ((((!(a25 == 9) && a29 <= 130 && !(10 == a25)) && a23 <= 599941) && 312 <= a23) && 1 == a4)) || ((a29 <= 276 && 1 == a4) && a23 + 271 <= 0)) || ((((((306 < a23 && a23 <= 599941) && 10 == a25) && a29 <= 277) && 1 == a4) || (((a29 <= 276 && a23 <= 599941) && 10 == a25) && 1 == a4)) && 130 <= a29)) || ((((((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 <= 9) && 1 == a4) || (((a29 <= 276 && a25 <= 9) && a23 <= 599941) && 1 == a4)) && 130 <= a29) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 22:31:22,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-15 22:31:22,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-11-15 22:31:22,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((1 == a3 && 10 == a25) && 15 == a8) && 260 <= a29) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && a4 == 1) || (((a25 == 13 && a29 <= 276) && a23 <= 599941) && 1 == a4)) || (((1 == a3 && (306 < a23 && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 10 == a25) && 15 == a8) && 1 == a4)) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((12 == a25 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || (((\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155) && 130 <= a29) && ((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4)) || (0 < a23 + 43 && a23 <= 138)) || (((a23 <= 312 && a25 <= 9) && 1 == a4) && !(a25 == 13) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (a23 <= 138 && !(a25 == 13) && a29 <= 140)) || ((((((!(a25 == 9) && 0 < a23 + 43) && !(10 == a25)) && 1 == a3) && 15 == a8) && a4 == 1) && a23 <= 306)) || (((a25 == 13 && a23 <= 312) && 0 < a23 + 43) && a4 == 1)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29)) || (12 == a25 && a23 <= 138)) || ((((!(a25 == 9) && a29 <= 130 && !(10 == a25)) && a23 <= 599941) && 312 <= a23) && 1 == a4)) || ((a29 <= 276 && 1 == a4) && a23 + 271 <= 0)) || ((((((306 < a23 && a23 <= 599941) && 10 == a25) && a29 <= 277) && 1 == a4) || (((a29 <= 276 && a23 <= 599941) && 10 == a25) && 1 == a4)) && 130 <= a29)) || ((((((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 <= 9) && 1 == a4) || (((a29 <= 276 && a25 <= 9) && a23 <= 599941) && 1 == a4)) && 130 <= a29) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 68.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, HoareTripleCheckerStatistics: 1533 SDtfs, 11267 SDslu, 886 SDs, 0 SdLazy, 30241 SolverSat, 4305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2936 GetRequests, 2834 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17171occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 26690 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 380 NumberOfFragments, 743 HoareAnnotationTreeSize, 3 FomulaSimplifications, 55542 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 101296 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 6850 NumberOfCodeBlocks, 6850 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6833 ConstructedInterpolants, 441 QuantifiedInterpolants, 21120690 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3609 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 6222/9434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...