./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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 18ca292e2a6683e70db5d6df9f8f197b4b3fc163 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:29:49,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:29:49,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:29:49,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:29:49,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:29:49,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:29:49,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:29:49,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:29:49,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:29:49,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:29:49,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:29:49,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:29:49,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:29:49,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:29:49,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:29:49,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:29:49,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:29:49,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:29:49,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:29:49,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:29:49,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:29:49,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:29:49,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:29:49,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:29:49,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:29:49,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:29:49,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:29:49,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:29:49,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:29:49,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:29:49,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:29:49,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:29:49,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:29:49,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:29:49,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:29:49,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:29:49,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:29:49,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:29:49,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:29:49,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:29:49,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:29:49,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:29:49,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:29:49,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:29:49,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:29:49,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:29:49,347 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:29:49,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:29:49,348 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:29:49,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:29:49,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:29:49,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:29:49,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:29:49,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:29:49,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:29:49,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:29:49,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:29:49,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:29:49,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:29:49,351 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_fe16b3d8-0102-457f-9071-4adc196dc363/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 -> 18ca292e2a6683e70db5d6df9f8f197b4b3fc163 [2019-12-07 11:29:49,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:29:49,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:29:49,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:29:49,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:29:49,466 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:29:49,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-12-07 11:29:49,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/data/444021fd0/77504bb564514fe7add6ba8c97b92019/FLAG18e43c211 [2019-12-07 11:29:50,048 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:29:50,048 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-12-07 11:29:50,061 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/data/444021fd0/77504bb564514fe7add6ba8c97b92019/FLAG18e43c211 [2019-12-07 11:29:50,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/data/444021fd0/77504bb564514fe7add6ba8c97b92019 [2019-12-07 11:29:50,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:29:50,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:29:50,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:50,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:29:50,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:29:50,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:50" (1/1) ... [2019-12-07 11:29:50,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:50, skipping insertion in model container [2019-12-07 11:29:50,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:50" (1/1) ... [2019-12-07 11:29:50,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:29:50,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:29:51,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:51,057 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:29:51,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:51,239 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:29:51,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51 WrapperNode [2019-12-07 11:29:51,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:51,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:51,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:29:51,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:29:51,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:51,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:29:51,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:29:51,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:29:51,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... [2019-12-07 11:29:51,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:29:51,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:29:51,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:29:51,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:29:51,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:29:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:29:51,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:29:53,137 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:29:53,137 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 11:29:53,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:53 BoogieIcfgContainer [2019-12-07 11:29:53,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:29:53,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:29:53,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:29:53,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:29:53,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:29:50" (1/3) ... [2019-12-07 11:29:53,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed09de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:53, skipping insertion in model container [2019-12-07 11:29:53,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:51" (2/3) ... [2019-12-07 11:29:53,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed09de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:53, skipping insertion in model container [2019-12-07 11:29:53,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:53" (3/3) ... [2019-12-07 11:29:53,143 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label10.c [2019-12-07 11:29:53,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:29:53,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:29:53,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:29:53,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:29:53,182 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:29:53,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:29:53,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:29:53,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:29:53,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:29:53,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:29:53,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:29:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 11:29:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:29:53,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:53,210 INFO L410 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] [2019-12-07 11:29:53,211 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-12-07 11:29:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:53,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332243788] [2019-12-07 11:29:53,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:53,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332243788] [2019-12-07 11:29:53,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:53,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:29:53,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995771955] [2019-12-07 11:29:53,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:53,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:53,405 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 11:29:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:57,501 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-12-07 11:29:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:57,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 11:29:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:57,521 INFO L225 Difference]: With dead ends: 1470 [2019-12-07 11:29:57,521 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 11:29:57,526 INFO L630 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-12-07 11:29:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 11:29:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-12-07 11:29:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 11:29:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-12-07 11:29:57,589 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 34 [2019-12-07 11:29:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:57,589 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-12-07 11:29:57,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-12-07 11:29:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:29:57,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:57,592 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:29:57,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 513841653, now seen corresponding path program 1 times [2019-12-07 11:29:57,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:57,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212506688] [2019-12-07 11:29:57,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:57,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212506688] [2019-12-07 11:29:57,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:57,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:57,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921021358] [2019-12-07 11:29:57,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:57,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:57,699 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-12-07 11:30:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:00,844 INFO L93 Difference]: Finished difference Result 3753 states and 5688 transitions. [2019-12-07 11:30:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:00,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:30:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:00,858 INFO L225 Difference]: With dead ends: 3753 [2019-12-07 11:30:00,858 INFO L226 Difference]: Without dead ends: 2779 [2019-12-07 11:30:00,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2019-12-07 11:30:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2774. [2019-12-07 11:30:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-07 11:30:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3761 transitions. [2019-12-07 11:30:00,914 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3761 transitions. Word has length 99 [2019-12-07 11:30:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:00,915 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 3761 transitions. [2019-12-07 11:30:00,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3761 transitions. [2019-12-07 11:30:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-12-07 11:30:00,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:00,922 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:30:00,922 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 41144329, now seen corresponding path program 1 times [2019-12-07 11:30:00,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:00,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568047248] [2019-12-07 11:30:00,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 11:30:01,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568047248] [2019-12-07 11:30:01,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562566024] [2019-12-07 11:30:01,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:30:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,214 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:30:01,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:01,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:01,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 11:30:01,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642108076] [2019-12-07 11:30:01,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:01,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:01,298 INFO L87 Difference]: Start difference. First operand 2774 states and 3761 transitions. Second operand 3 states. [2019-12-07 11:30:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:02,782 INFO L93 Difference]: Finished difference Result 7940 states and 10821 transitions. [2019-12-07 11:30:02,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:02,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-12-07 11:30:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:02,800 INFO L225 Difference]: With dead ends: 7940 [2019-12-07 11:30:02,800 INFO L226 Difference]: Without dead ends: 5168 [2019-12-07 11:30:02,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 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-12-07 11:30:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-12-07 11:30:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-12-07 11:30:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-07 11:30:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4114 transitions. [2019-12-07 11:30:02,852 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4114 transitions. Word has length 244 [2019-12-07 11:30:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:02,853 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 4114 transitions. [2019-12-07 11:30:02,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4114 transitions. [2019-12-07 11:30:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-12-07 11:30:02,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:02,856 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:03,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:03,057 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1594241081, now seen corresponding path program 1 times [2019-12-07 11:30:03,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:03,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073954035] [2019-12-07 11:30:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:30:03,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073954035] [2019-12-07 11:30:03,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:03,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:03,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441639105] [2019-12-07 11:30:03,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:03,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:03,427 INFO L87 Difference]: Start difference. First operand 3073 states and 4114 transitions. Second operand 5 states. [2019-12-07 11:30:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:05,881 INFO L93 Difference]: Finished difference Result 7342 states and 9540 transitions. [2019-12-07 11:30:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:05,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-12-07 11:30:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:05,895 INFO L225 Difference]: With dead ends: 7342 [2019-12-07 11:30:05,896 INFO L226 Difference]: Without dead ends: 4271 [2019-12-07 11:30:05,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-12-07 11:30:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-12-07 11:30:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-12-07 11:30:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5078 transitions. [2019-12-07 11:30:05,943 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5078 transitions. Word has length 312 [2019-12-07 11:30:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:05,943 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5078 transitions. [2019-12-07 11:30:05,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5078 transitions. [2019-12-07 11:30:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-12-07 11:30:05,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:05,948 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:30:05,948 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1017767819, now seen corresponding path program 1 times [2019-12-07 11:30:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:05,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788246167] [2019-12-07 11:30:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:06,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788246167] [2019-12-07 11:30:06,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:06,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:06,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881788302] [2019-12-07 11:30:06,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:06,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:06,205 INFO L87 Difference]: Start difference. First operand 3971 states and 5078 transitions. Second operand 4 states. [2019-12-07 11:30:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:09,418 INFO L93 Difference]: Finished difference Result 9739 states and 12737 transitions. [2019-12-07 11:30:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:09,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2019-12-07 11:30:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:09,438 INFO L225 Difference]: With dead ends: 9739 [2019-12-07 11:30:09,438 INFO L226 Difference]: Without dead ends: 5770 [2019-12-07 11:30:09,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-07 11:30:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2019-12-07 11:30:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-12-07 11:30:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7242 transitions. [2019-12-07 11:30:09,497 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7242 transitions. Word has length 386 [2019-12-07 11:30:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:09,498 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7242 transitions. [2019-12-07 11:30:09,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7242 transitions. [2019-12-07 11:30:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 11:30:09,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:09,506 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:30:09,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1359235136, now seen corresponding path program 1 times [2019-12-07 11:30:09,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:09,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393485077] [2019-12-07 11:30:09,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 380 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:30:10,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393485077] [2019-12-07 11:30:10,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278521425] [2019-12-07 11:30:10,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:30:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:10,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:30:10,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 11:30:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 11:30:10,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612806233] [2019-12-07 11:30:10,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:10,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:10,527 INFO L87 Difference]: Start difference. First operand 5767 states and 7242 transitions. Second operand 3 states. [2019-12-07 11:30:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:11,975 INFO L93 Difference]: Finished difference Result 11532 states and 14482 transitions. [2019-12-07 11:30:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:11,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2019-12-07 11:30:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:11,993 INFO L225 Difference]: With dead ends: 11532 [2019-12-07 11:30:11,994 INFO L226 Difference]: Without dead ends: 5767 [2019-12-07 11:30:11,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-12-07 11:30:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-12-07 11:30:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-12-07 11:30:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7110 transitions. [2019-12-07 11:30:12,049 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7110 transitions. Word has length 461 [2019-12-07 11:30:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,050 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7110 transitions. [2019-12-07 11:30:12,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7110 transitions. [2019-12-07 11:30:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 11:30:12,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,055 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:30:12,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:12,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash 746660272, now seen corresponding path program 1 times [2019-12-07 11:30:12,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:12,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319296361] [2019-12-07 11:30:12,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 260 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:12,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319296361] [2019-12-07 11:30:12,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24455654] [2019-12-07 11:30:12,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:30:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:13,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:30:13,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 11:30:13,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:13,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 11:30:13,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538674735] [2019-12-07 11:30:13,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:13,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:30:13,221 INFO L87 Difference]: Start difference. First operand 5767 states and 7110 transitions. Second operand 3 states. [2019-12-07 11:30:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:14,544 INFO L93 Difference]: Finished difference Result 11531 states and 14218 transitions. [2019-12-07 11:30:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:14,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-12-07 11:30:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:14,562 INFO L225 Difference]: With dead ends: 11531 [2019-12-07 11:30:14,562 INFO L226 Difference]: Without dead ends: 5766 [2019-12-07 11:30:14,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 538 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:30:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-12-07 11:30:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5764. [2019-12-07 11:30:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-12-07 11:30:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6589 transitions. [2019-12-07 11:30:14,659 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6589 transitions. Word has length 537 [2019-12-07 11:30:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:14,659 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6589 transitions. [2019-12-07 11:30:14,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6589 transitions. [2019-12-07 11:30:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-12-07 11:30:14,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:14,666 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 11:30:14,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:14,868 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -941780573, now seen corresponding path program 1 times [2019-12-07 11:30:14,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:14,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756483940] [2019-12-07 11:30:14,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 567 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 11:30:15,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756483940] [2019-12-07 11:30:15,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679116148] [2019-12-07 11:30:15,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:30:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:15,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:30:15,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-12-07 11:30:15,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:16,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 11:30:16,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431662181] [2019-12-07 11:30:16,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:16,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:16,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:16,001 INFO L87 Difference]: Start difference. First operand 5764 states and 6589 transitions. Second operand 3 states. [2019-12-07 11:30:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:17,212 INFO L93 Difference]: Finished difference Result 13020 states and 14983 transitions. [2019-12-07 11:30:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:17,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-12-07 11:30:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:17,222 INFO L225 Difference]: With dead ends: 13020 [2019-12-07 11:30:17,222 INFO L226 Difference]: Without dead ends: 7258 [2019-12-07 11:30:17,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 561 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-12-07 11:30:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2019-12-07 11:30:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-12-07 11:30:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8190 transitions. [2019-12-07 11:30:17,280 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8190 transitions. Word has length 562 [2019-12-07 11:30:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:17,281 INFO L462 AbstractCegarLoop]: Abstraction has 7258 states and 8190 transitions. [2019-12-07 11:30:17,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8190 transitions. [2019-12-07 11:30:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-12-07 11:30:17,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:17,286 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:30:17,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:17,487 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:17,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash -95465411, now seen corresponding path program 1 times [2019-12-07 11:30:17,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:17,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034014902] [2019-12-07 11:30:17,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 354 proven. 32 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 11:30:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034014902] [2019-12-07 11:30:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025245071] [2019-12-07 11:30:17,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/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-12-07 11:30:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:18,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:30:18,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-12-07 11:30:18,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:18,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 11:30:18,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092639550] [2019-12-07 11:30:18,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:18,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:30:18,541 INFO L87 Difference]: Start difference. First operand 7258 states and 8190 transitions. Second operand 3 states. [2019-12-07 11:30:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:50,167 INFO L93 Difference]: Finished difference Result 20211 states and 22785 transitions. [2019-12-07 11:30:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:50,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 596 [2019-12-07 11:30:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:50,188 INFO L225 Difference]: With dead ends: 20211 [2019-12-07 11:30:50,189 INFO L226 Difference]: Without dead ends: 12955 [2019-12-07 11:30:50,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:30:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states. [2019-12-07 11:30:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 11746. [2019-12-07 11:30:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11746 states. [2019-12-07 11:30:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11746 states to 11746 states and 13247 transitions. [2019-12-07 11:30:50,296 INFO L78 Accepts]: Start accepts. Automaton has 11746 states and 13247 transitions. Word has length 596 [2019-12-07 11:30:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:50,296 INFO L462 AbstractCegarLoop]: Abstraction has 11746 states and 13247 transitions. [2019-12-07 11:30:50,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 11746 states and 13247 transitions. [2019-12-07 11:30:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-12-07 11:30:50,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:50,304 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:30:50,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:50,505 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1519482735, now seen corresponding path program 1 times [2019-12-07 11:30:50,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:50,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873997575] [2019-12-07 11:30:50,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 631 proven. 3 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-12-07 11:30:51,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873997575] [2019-12-07 11:30:51,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412519587] [2019-12-07 11:30:51,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:51,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:30:51,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:51,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 11:30:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 11:30:52,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:52,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-12-07 11:30:52,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008376790] [2019-12-07 11:30:52,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:52,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:52,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:52,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:30:52,282 INFO L87 Difference]: Start difference. First operand 11746 states and 13247 transitions. Second operand 5 states. [2019-12-07 11:30:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:55,019 INFO L93 Difference]: Finished difference Result 27832 states and 31337 transitions. [2019-12-07 11:30:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:30:55,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 675 [2019-12-07 11:30:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:55,034 INFO L225 Difference]: With dead ends: 27832 [2019-12-07 11:30:55,034 INFO L226 Difference]: Without dead ends: 16088 [2019-12-07 11:30:55,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 674 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:30:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2019-12-07 11:30:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 15636. [2019-12-07 11:30:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15636 states. [2019-12-07 11:30:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15636 states to 15636 states and 17354 transitions. [2019-12-07 11:30:55,199 INFO L78 Accepts]: Start accepts. Automaton has 15636 states and 17354 transitions. Word has length 675 [2019-12-07 11:30:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:55,200 INFO L462 AbstractCegarLoop]: Abstraction has 15636 states and 17354 transitions. [2019-12-07 11:30:55,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15636 states and 17354 transitions. [2019-12-07 11:30:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-12-07 11:30:55,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:55,210 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 11:30:55,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:55,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 377870459, now seen corresponding path program 1 times [2019-12-07 11:30:55,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:55,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310549202] [2019-12-07 11:30:55,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 707 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 11:30:56,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310549202] [2019-12-07 11:30:56,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682543645] [2019-12-07 11:30:56,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:56,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:30:56,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:56,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 671 proven. 39 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 11:30:57,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:30:57,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 11:30:57,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036462282] [2019-12-07 11:30:57,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:30:57,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:30:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:30:57,089 INFO L87 Difference]: Start difference. First operand 15636 states and 17354 transitions. Second operand 9 states. [2019-12-07 11:31:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:03,068 INFO L93 Difference]: Finished difference Result 37404 states and 41218 transitions. [2019-12-07 11:31:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:31:03,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 700 [2019-12-07 11:31:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:03,079 INFO L225 Difference]: With dead ends: 37404 [2019-12-07 11:31:03,079 INFO L226 Difference]: Without dead ends: 16232 [2019-12-07 11:31:03,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 698 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:31:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16232 states. [2019-12-07 11:31:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16232 to 12943. [2019-12-07 11:31:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12943 states. [2019-12-07 11:31:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12943 states to 12943 states and 13556 transitions. [2019-12-07 11:31:03,206 INFO L78 Accepts]: Start accepts. Automaton has 12943 states and 13556 transitions. Word has length 700 [2019-12-07 11:31:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:03,206 INFO L462 AbstractCegarLoop]: Abstraction has 12943 states and 13556 transitions. [2019-12-07 11:31:03,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:31:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 12943 states and 13556 transitions. [2019-12-07 11:31:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-12-07 11:31:03,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:03,215 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:31:03,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:03,416 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:03,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash -253950539, now seen corresponding path program 1 times [2019-12-07 11:31:03,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:03,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174832687] [2019-12-07 11:31:03,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 95 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:05,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174832687] [2019-12-07 11:31:05,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946233853] [2019-12-07 11:31:05,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:05,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:31:05,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:31:05,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:05,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 11:31:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 470 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:06,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:31:06,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-12-07 11:31:06,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170290705] [2019-12-07 11:31:06,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:31:06,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:31:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:31:06,629 INFO L87 Difference]: Start difference. First operand 12943 states and 13556 transitions. Second operand 14 states. [2019-12-07 11:31:08,346 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-07 11:31:08,566 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 11:31:10,127 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-07 11:31:10,457 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-07 11:31:18,237 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-07 11:31:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:26,356 INFO L93 Difference]: Finished difference Result 45163 states and 47280 transitions. [2019-12-07 11:31:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 11:31:26,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 703 [2019-12-07 11:31:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:26,379 INFO L225 Difference]: With dead ends: 45163 [2019-12-07 11:31:26,379 INFO L226 Difference]: Without dead ends: 31922 [2019-12-07 11:31:26,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 733 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=619, Invalid=2351, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 11:31:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31922 states. [2019-12-07 11:31:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31922 to 20347. [2019-12-07 11:31:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20347 states. [2019-12-07 11:31:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20347 states to 20347 states and 21109 transitions. [2019-12-07 11:31:26,598 INFO L78 Accepts]: Start accepts. Automaton has 20347 states and 21109 transitions. Word has length 703 [2019-12-07 11:31:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:26,599 INFO L462 AbstractCegarLoop]: Abstraction has 20347 states and 21109 transitions. [2019-12-07 11:31:26,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:31:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20347 states and 21109 transitions. [2019-12-07 11:31:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-12-07 11:31:26,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:26,616 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:31:26,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:26,817 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1586778385, now seen corresponding path program 1 times [2019-12-07 11:31:26,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:26,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546329768] [2019-12-07 11:31:26,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2019-12-07 11:31:27,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546329768] [2019-12-07 11:31:27,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:27,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:31:27,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548487751] [2019-12-07 11:31:27,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:31:27,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:31:27,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:31:27,307 INFO L87 Difference]: Start difference. First operand 20347 states and 21109 transitions. Second operand 3 states. [2019-12-07 11:31:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:28,335 INFO L93 Difference]: Finished difference Result 41600 states and 43150 transitions. [2019-12-07 11:31:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:31:28,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 829 [2019-12-07 11:31:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:28,349 INFO L225 Difference]: With dead ends: 41600 [2019-12-07 11:31:28,349 INFO L226 Difference]: Without dead ends: 20956 [2019-12-07 11:31:28,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:31:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20956 states. [2019-12-07 11:31:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20956 to 19147. [2019-12-07 11:31:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19147 states. [2019-12-07 11:31:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19147 states to 19147 states and 19855 transitions. [2019-12-07 11:31:28,531 INFO L78 Accepts]: Start accepts. Automaton has 19147 states and 19855 transitions. Word has length 829 [2019-12-07 11:31:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:28,531 INFO L462 AbstractCegarLoop]: Abstraction has 19147 states and 19855 transitions. [2019-12-07 11:31:28,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:31:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19147 states and 19855 transitions. [2019-12-07 11:31:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-12-07 11:31:28,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:28,551 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 11:31:28,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:28,552 INFO L82 PathProgramCache]: Analyzing trace with hash 508940287, now seen corresponding path program 1 times [2019-12-07 11:31:28,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:28,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239135223] [2019-12-07 11:31:28,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 128 proven. 809 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:31:31,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239135223] [2019-12-07 11:31:31,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890610485] [2019-12-07 11:31:31,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:31,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:31:31,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-12-07 11:31:31,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:31:31,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 11:31:31,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126561990] [2019-12-07 11:31:31,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:31:31,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:31:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:31:31,629 INFO L87 Difference]: Start difference. First operand 19147 states and 19855 transitions. Second operand 3 states. [2019-12-07 11:31:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:32,386 INFO L93 Difference]: Finished difference Result 38292 states and 39708 transitions. [2019-12-07 11:31:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:31:32,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 876 [2019-12-07 11:31:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:32,402 INFO L225 Difference]: With dead ends: 38292 [2019-12-07 11:31:32,402 INFO L226 Difference]: Without dead ends: 19147 [2019-12-07 11:31:32,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 876 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:31:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19147 states. [2019-12-07 11:31:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19147 to 17648. [2019-12-07 11:31:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17648 states. [2019-12-07 11:31:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17648 states to 17648 states and 18211 transitions. [2019-12-07 11:31:32,564 INFO L78 Accepts]: Start accepts. Automaton has 17648 states and 18211 transitions. Word has length 876 [2019-12-07 11:31:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:32,564 INFO L462 AbstractCegarLoop]: Abstraction has 17648 states and 18211 transitions. [2019-12-07 11:31:32,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:31:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17648 states and 18211 transitions. [2019-12-07 11:31:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2019-12-07 11:31:32,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:32,583 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 11:31:32,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:32,784 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1348202738, now seen corresponding path program 1 times [2019-12-07 11:31:32,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:32,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869063397] [2019-12-07 11:31:32,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 737 proven. 140 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 11:31:33,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869063397] [2019-12-07 11:31:33,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461427705] [2019-12-07 11:31:33,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:33,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:31:33,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 11:31:34,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:31:34,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 11:31:34,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979673067] [2019-12-07 11:31:34,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:31:34,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:31:34,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:31:34,226 INFO L87 Difference]: Start difference. First operand 17648 states and 18211 transitions. Second operand 3 states. [2019-12-07 11:31:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:35,214 INFO L93 Difference]: Finished difference Result 35294 states and 36420 transitions. [2019-12-07 11:31:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:31:35,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 881 [2019-12-07 11:31:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:35,226 INFO L225 Difference]: With dead ends: 35294 [2019-12-07 11:31:35,226 INFO L226 Difference]: Without dead ends: 17648 [2019-12-07 11:31:35,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 882 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:31:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17648 states. [2019-12-07 11:31:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17648 to 17028. [2019-12-07 11:31:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17028 states. [2019-12-07 11:31:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17028 states to 17028 states and 17515 transitions. [2019-12-07 11:31:35,373 INFO L78 Accepts]: Start accepts. Automaton has 17028 states and 17515 transitions. Word has length 881 [2019-12-07 11:31:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:35,374 INFO L462 AbstractCegarLoop]: Abstraction has 17028 states and 17515 transitions. [2019-12-07 11:31:35,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:31:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 17028 states and 17515 transitions. [2019-12-07 11:31:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2019-12-07 11:31:35,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:35,386 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 11:31:35,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:35,587 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -926627041, now seen corresponding path program 1 times [2019-12-07 11:31:35,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:35,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566240311] [2019-12-07 11:31:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 11:31:36,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566240311] [2019-12-07 11:31:36,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:36,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:31:36,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912255440] [2019-12-07 11:31:36,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:31:36,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:31:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:31:36,314 INFO L87 Difference]: Start difference. First operand 17028 states and 17515 transitions. Second operand 4 states. [2019-12-07 11:31:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:37,481 INFO L93 Difference]: Finished difference Result 39427 states and 40609 transitions. [2019-12-07 11:31:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:31:37,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 895 [2019-12-07 11:31:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:37,496 INFO L225 Difference]: With dead ends: 39427 [2019-12-07 11:31:37,496 INFO L226 Difference]: Without dead ends: 22401 [2019-12-07 11:31:37,503 INFO L630 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-12-07 11:31:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2019-12-07 11:31:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 16190. [2019-12-07 11:31:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16190 states. [2019-12-07 11:31:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16190 states to 16190 states and 16605 transitions. [2019-12-07 11:31:37,672 INFO L78 Accepts]: Start accepts. Automaton has 16190 states and 16605 transitions. Word has length 895 [2019-12-07 11:31:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:37,673 INFO L462 AbstractCegarLoop]: Abstraction has 16190 states and 16605 transitions. [2019-12-07 11:31:37,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:31:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 16190 states and 16605 transitions. [2019-12-07 11:31:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-12-07 11:31:37,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:37,687 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:37,687 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash 625408752, now seen corresponding path program 1 times [2019-12-07 11:31:37,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:31:37,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038849788] [2019-12-07 11:31:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:31:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 783 proven. 140 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-12-07 11:31:40,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038849788] [2019-12-07 11:31:40,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589393831] [2019-12-07 11:31:40,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:31:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:40,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:31:40,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:31:40,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:31:40,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:31:40,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:31:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 730 proven. 32 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2019-12-07 11:31:41,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:31:41,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-12-07 11:31:41,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751230200] [2019-12-07 11:31:41,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:31:41,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:31:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:31:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:31:41,133 INFO L87 Difference]: Start difference. First operand 16190 states and 16605 transitions. Second operand 17 states. [2019-12-07 11:31:45,788 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 11:31:49,843 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-12-07 11:31:50,200 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-07 11:31:50,604 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 11:31:53,110 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 11:31:55,431 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 11:31:55,867 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 11:31:56,357 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 11:31:57,360 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-12-07 11:32:01,638 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 11:32:02,833 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 11:32:03,743 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 11:32:05,037 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 11:32:11,442 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 11:32:13,721 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 11:32:17,553 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 11:32:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:17,645 INFO L93 Difference]: Finished difference Result 45562 states and 46697 transitions. [2019-12-07 11:32:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-07 11:32:17,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 967 [2019-12-07 11:32:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:17,664 INFO L225 Difference]: With dead ends: 45562 [2019-12-07 11:32:17,665 INFO L226 Difference]: Without dead ends: 29066 [2019-12-07 11:32:17,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4210 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2097, Invalid=9033, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 11:32:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29066 states. [2019-12-07 11:32:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29066 to 20081. [2019-12-07 11:32:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20081 states. [2019-12-07 11:32:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 20546 transitions. [2019-12-07 11:32:17,876 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 20546 transitions. Word has length 967 [2019-12-07 11:32:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:17,877 INFO L462 AbstractCegarLoop]: Abstraction has 20081 states and 20546 transitions. [2019-12-07 11:32:17,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:32:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 20546 transitions. [2019-12-07 11:32:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-12-07 11:32:17,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:17,895 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:32:18,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:32:18,096 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -19826569, now seen corresponding path program 1 times [2019-12-07 11:32:18,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:18,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010024880] [2019-12-07 11:32:18,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 1247 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-12-07 11:32:18,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010024880] [2019-12-07 11:32:18,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:18,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:32:18,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082346020] [2019-12-07 11:32:18,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:32:18,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:18,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:32:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:32:18,784 INFO L87 Difference]: Start difference. First operand 20081 states and 20546 transitions. Second operand 3 states. [2019-12-07 11:32:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:19,603 INFO L93 Difference]: Finished difference Result 39859 states and 40787 transitions. [2019-12-07 11:32:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:32:19,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1072 [2019-12-07 11:32:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:19,616 INFO L225 Difference]: With dead ends: 39859 [2019-12-07 11:32:19,616 INFO L226 Difference]: Without dead ends: 19780 [2019-12-07 11:32:19,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:32:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2019-12-07 11:32:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 19780. [2019-12-07 11:32:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19780 states. [2019-12-07 11:32:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 20241 transitions. [2019-12-07 11:32:19,787 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 20241 transitions. Word has length 1072 [2019-12-07 11:32:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:19,788 INFO L462 AbstractCegarLoop]: Abstraction has 19780 states and 20241 transitions. [2019-12-07 11:32:19,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:32:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 20241 transitions. [2019-12-07 11:32:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-12-07 11:32:19,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:19,811 INFO L410 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:19,812 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1177924935, now seen corresponding path program 1 times [2019-12-07 11:32:19,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:19,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007864150] [2019-12-07 11:32:19,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-12-07 11:32:20,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007864150] [2019-12-07 11:32:20,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:20,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:32:20,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233128268] [2019-12-07 11:32:20,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:32:20,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:32:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:32:20,721 INFO L87 Difference]: Start difference. First operand 19780 states and 20241 transitions. Second operand 5 states. [2019-12-07 11:32:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:22,632 INFO L93 Difference]: Finished difference Result 33535 states and 34245 transitions. [2019-12-07 11:32:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:32:22,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1093 [2019-12-07 11:32:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:22,648 INFO L225 Difference]: With dead ends: 33535 [2019-12-07 11:32:22,648 INFO L226 Difference]: Without dead ends: 13757 [2019-12-07 11:32:22,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:32:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2019-12-07 11:32:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 12297. [2019-12-07 11:32:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12297 states. [2019-12-07 11:32:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 12491 transitions. [2019-12-07 11:32:22,769 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 12491 transitions. Word has length 1093 [2019-12-07 11:32:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:22,770 INFO L462 AbstractCegarLoop]: Abstraction has 12297 states and 12491 transitions. [2019-12-07 11:32:22,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:32:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 12491 transitions. [2019-12-07 11:32:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2019-12-07 11:32:22,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:22,784 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:32:22,784 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1285765188, now seen corresponding path program 1 times [2019-12-07 11:32:22,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:22,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918302827] [2019-12-07 11:32:22,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 889 proven. 1103 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 11:32:27,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918302827] [2019-12-07 11:32:27,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650787377] [2019-12-07 11:32:27,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:32:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:27,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:32:27,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:32:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:32:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 1749 proven. 2 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-12-07 11:32:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:32:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-12-07 11:32:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834117105] [2019-12-07 11:32:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:32:28,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:32:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:32:28,455 INFO L87 Difference]: Start difference. First operand 12297 states and 12491 transitions. Second operand 25 states. [2019-12-07 11:32:30,771 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 11:32:34,589 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-12-07 11:32:37,612 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 11:32:39,799 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-12-07 11:32:43,532 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-12-07 11:32:44,845 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 11:32:48,181 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-07 11:32:49,544 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 11:32:50,205 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2019-12-07 11:32:56,844 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 11:33:00,332 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-12-07 11:33:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:06,599 INFO L93 Difference]: Finished difference Result 32328 states and 32832 transitions. [2019-12-07 11:33:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-07 11:33:06,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1135 [2019-12-07 11:33:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:06,613 INFO L225 Difference]: With dead ends: 32328 [2019-12-07 11:33:06,613 INFO L226 Difference]: Without dead ends: 20332 [2019-12-07 11:33:06,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1279 GetRequests, 1182 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2417 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1465, Invalid=6907, Unknown=0, NotChecked=0, Total=8372 [2019-12-07 11:33:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20332 states. [2019-12-07 11:33:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20332 to 13716. [2019-12-07 11:33:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13716 states. [2019-12-07 11:33:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13716 states to 13716 states and 13910 transitions. [2019-12-07 11:33:06,765 INFO L78 Accepts]: Start accepts. Automaton has 13716 states and 13910 transitions. Word has length 1135 [2019-12-07 11:33:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:06,766 INFO L462 AbstractCegarLoop]: Abstraction has 13716 states and 13910 transitions. [2019-12-07 11:33:06,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:33:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13716 states and 13910 transitions. [2019-12-07 11:33:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2019-12-07 11:33:06,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:06,782 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 11:33:06,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:06,982 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1805484970, now seen corresponding path program 1 times [2019-12-07 11:33:06,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:06,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230974412] [2019-12-07 11:33:06,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 1371 proven. 64 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2019-12-07 11:33:09,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230974412] [2019-12-07 11:33:09,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550774337] [2019-12-07 11:33:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:10,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 11:33:10,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:10,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:33:10,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:10,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:10,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 984 proven. 24 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-12-07 11:33:12,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:33:12,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-12-07 11:33:12,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723854228] [2019-12-07 11:33:12,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:33:12,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:33:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:33:12,126 INFO L87 Difference]: Start difference. First operand 13716 states and 13910 transitions. Second operand 16 states. [2019-12-07 11:33:19,807 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 11:33:20,629 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-12-07 11:33:23,614 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 11:33:24,017 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 11:33:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:30,070 INFO L93 Difference]: Finished difference Result 38567 states and 39109 transitions. [2019-12-07 11:33:30,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 11:33:30,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1147 [2019-12-07 11:33:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:30,095 INFO L225 Difference]: With dead ends: 38567 [2019-12-07 11:33:30,095 INFO L226 Difference]: Without dead ends: 25152 [2019-12-07 11:33:30,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1174 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=997, Invalid=3973, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 11:33:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25152 states. [2019-12-07 11:33:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25152 to 11917. [2019-12-07 11:33:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11917 states. [2019-12-07 11:33:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 12076 transitions. [2019-12-07 11:33:30,253 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 12076 transitions. Word has length 1147 [2019-12-07 11:33:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:30,254 INFO L462 AbstractCegarLoop]: Abstraction has 11917 states and 12076 transitions. [2019-12-07 11:33:30,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:33:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 12076 transitions. [2019-12-07 11:33:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2019-12-07 11:33:30,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:30,269 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 11:33:30,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:30,470 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -111973134, now seen corresponding path program 1 times [2019-12-07 11:33:30,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:30,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352534990] [2019-12-07 11:33:30,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 1013 proven. 32 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-12-07 11:33:33,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352534990] [2019-12-07 11:33:33,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026380336] [2019-12-07 11:33:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:33,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:33:33,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:33,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:33,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:33,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:36,262 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2019-12-07 11:33:36,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 1563 proven. 64 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2019-12-07 11:33:38,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:33:38,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2019-12-07 11:33:38,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059945800] [2019-12-07 11:33:38,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:33:38,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:33:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:33:38,318 INFO L87 Difference]: Start difference. First operand 11917 states and 12076 transitions. Second operand 18 states. [2019-12-07 11:33:46,042 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-07 11:34:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:19,434 INFO L93 Difference]: Finished difference Result 39449 states and 39982 transitions. [2019-12-07 11:34:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-07 11:34:19,435 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1220 [2019-12-07 11:34:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:19,436 INFO L225 Difference]: With dead ends: 39449 [2019-12-07 11:34:19,436 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:34:19,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1281 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1226, Invalid=6606, Unknown=0, NotChecked=0, Total=7832 [2019-12-07 11:34:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:34:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:34:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:34:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:34:19,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1220 [2019-12-07 11:34:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:19,447 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:34:19,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:34:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:34:19,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:34:19,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:19,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:34:22,148 WARN L192 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 1043 DAG size of output: 840 [2019-12-07 11:34:24,577 WARN L192 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 1042 DAG size of output: 839 [2019-12-07 11:34:25,176 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 656 DAG size of output: 568 [2019-12-07 11:34:37,298 WARN L192 SmtUtils]: Spent 12.12 s on a formula simplification. DAG size of input: 769 DAG size of output: 185 [2019-12-07 11:34:50,124 WARN L192 SmtUtils]: Spent 12.82 s on a formula simplification. DAG size of input: 766 DAG size of output: 185 [2019-12-07 11:34:59,617 WARN L192 SmtUtils]: Spent 9.49 s on a formula simplification. DAG size of input: 527 DAG size of output: 174 [2019-12-07 11:34:59,620 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,621 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,622 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,623 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,624 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 11:34:59,625 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 11:34:59,626 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,627 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,628 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 11:34:59,629 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,630 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,631 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse19 (= 3 ~a2~0)) (.cse32 (+ ~a4~0 86)) (.cse33 (+ ~a0~0 147)) (.cse34 (+ ~a0~0 98))) (let ((.cse14 (= 4 ~a2~0)) (.cse27 (+ ~a29~0 127)) (.cse0 (<= .cse34 0)) (.cse24 (<= .cse33 0)) (.cse31 (+ ~a4~0 42)) (.cse26 (<= 0 (+ ~a0~0 44))) (.cse7 (<= .cse32 0)) (.cse4 (not .cse19))) (let ((.cse16 (<= (+ ~a0~0 104) 0)) (.cse23 (< 0 (+ ~a29~0 16))) (.cse9 (<= (+ ~a0~0 61) 0)) (.cse8 (= 1 ~a2~0)) (.cse1 (<= ~a29~0 41)) (.cse11 (<= ~a29~0 43)) (.cse13 (or (and .cse26 .cse4) (and .cse7 .cse4))) (.cse29 (or .cse7 .cse24 (not (= 2 ULTIMATE.start_calculate_output2_~input)) (< 0 .cse31) (< 0 .cse34))) (.cse10 (< 0 .cse33)) (.cse30 (or .cse7 .cse24 (not (= 2 ULTIMATE.start_calculate_output_~input)))) (.cse20 (or .cse7 .cse0)) (.cse21 (= 2 ~a2~0)) (.cse12 (<= ~a29~0 42)) (.cse15 (<= 0 (+ ~a29~0 192415))) (.cse28 (< 0 .cse32)) (.cse18 (<= (+ ~a0~0 148) 0)) (.cse22 (<= .cse27 0)) (.cse17 (< 43 ~a29~0)) (.cse2 (<= .cse31 0)) (.cse3 (not .cse14)) (.cse5 (<= 0 (+ ~a29~0 600000))) (.cse6 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse8 .cse10 .cse11 .cse5) (and .cse2 .cse12 .cse13 .cse14 .cse5) (and .cse1 .cse2 .cse8 .cse10 .cse9 .cse15) (and .cse2 (or .cse10 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse16 .cse4 .cse17 .cse6) (and .cse2 .cse8 .cse18 .cse17) (and .cse2 (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) .cse16 .cse19) (and .cse20 .cse13 .cse21 .cse22 .cse5) (and .cse7 .cse22 .cse5 .cse6 (<= ~a2~0 4)) (and .cse2 .cse23 .cse24 .cse21) (and .cse2 .cse1 .cse13 .cse15 .cse6) (and .cse20 .cse13 .cse21 (exists ((v_prenex_1 Int)) (let ((.cse25 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse25) (<= ~a29~0 (+ (mod .cse25 29) 14))))) .cse15) (and .cse13 .cse21 .cse9) (and .cse7 .cse1 .cse23 .cse6) (and .cse7 .cse11 .cse9 .cse6) (and (<= (+ ~a4~0 89) 0) .cse8 .cse26 .cse22 (<= 0 .cse27)) (and .cse2 .cse1 .cse28 .cse8 (< 0 (+ ~a29~0 144))) (and .cse0 .cse1 .cse29 .cse2 .cse10 .cse21 .cse30 .cse15) (and .cse2 .cse24 .cse11 .cse19) (and .cse7 .cse13 .cse17 .cse6) (and .cse7 .cse10 .cse19 .cse17) (and .cse0 .cse2 .cse29 (<= 14659 ~a29~0) .cse10 .cse3 .cse30 .cse6) (and .cse2 .cse20 (<= ~a29~0 599998) .cse21 .cse17) (and .cse2 .cse12 .cse18 .cse14 .cse15) (and .cse2 (or (and .cse28 .cse18 .cse3 .cse6) (and .cse18 .cse22 .cse6)) .cse5) (and .cse2 .cse0 .cse3 .cse4 .cse6 .cse17) (and .cse2 .cse24 .cse3 .cse4 .cse5 .cse6))))) [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 11:34:59,632 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,633 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse33 (+ ~a0~0 147)) (.cse34 (+ ~a4~0 86)) (.cse35 (+ ~a0~0 98)) (.cse16 (= 3 ~a2~0))) (let ((.cse8 (= 4 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse28 (<= 0 (+ ~a0~0 44))) (.cse24 (not .cse16)) (.cse0 (<= .cse35 0)) (.cse29 (+ ~a29~0 127)) (.cse20 (<= .cse34 0)) (.cse22 (<= .cse33 0)) (.cse32 (+ ~a4~0 42))) (let ((.cse6 (<= ~a29~0 42)) (.cse21 (< 0 (+ ~a29~0 16))) (.cse25 (or .cse20 .cse22 (< 0 .cse32) (not (= 2 ULTIMATE.start_calculate_output_~input)) (< 0 .cse35))) (.cse15 (<= (+ ~a0~0 104) 0)) (.cse12 (<= (+ ~a0~0 148) 0)) (.cse19 (<= .cse29 0)) (.cse4 (<= ~a29~0 43)) (.cse30 (< 0 .cse34)) (.cse27 (+ ~a29~0 144)) (.cse18 (or .cse20 .cse0)) (.cse17 (= 2 ~a2~0)) (.cse3 (< 0 .cse33)) (.cse14 (< 43 ~a29~0)) (.cse9 (<= ~a29~0 41)) (.cse7 (or (and .cse28 .cse24) (and .cse20 .cse24))) (.cse11 (<= 0 (+ ~a29~0 192415))) (.cse26 (or (and .cse2 .cse28) (and .cse20 .cse2))) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse1 (<= .cse32 0)) (.cse23 (not .cse8)) (.cse5 (<= 0 (+ ~a29~0 600000))) (.cse13 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse1 .cse6 .cse12 .cse13 .cse11) (and .cse1 .cse2 .cse12 .cse14) (and .cse1 (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) .cse15 .cse16) (and .cse0 .cse1 (<= ~a29~0 599998) .cse17 .cse14) (and .cse18 .cse7 .cse17 .cse19 .cse5) (and .cse20 .cse19 .cse5 .cse13 (<= ~a2~0 4)) (and .cse1 .cse21 .cse22 .cse17) (and .cse7 .cse17 .cse10) (and .cse9 .cse1 .cse0 .cse23 .cse24 .cse5 .cse13) (and .cse20 .cse4 .cse10 .cse13) (and .cse20 .cse9 .cse21 .cse13) (and .cse25 .cse0 .cse1 (<= 14659 ~a29~0) .cse3 .cse16) (and .cse1 (or (and .cse9 .cse21 .cse18 .cse17) (and .cse25 .cse9 .cse18 .cse3 .cse17 .cse11))) (and .cse20 .cse26 (<= .cse27 0)) (and .cse1 .cse15 .cse24 .cse14 .cse13) (and .cse0 .cse1 .cse23 .cse24 .cse13 .cse14) (and (<= (+ ~a4~0 89) 0) .cse2 .cse28 .cse19 (<= 0 .cse29)) (and .cse1 (or (and .cse30 .cse12 .cse14 .cse13) (and .cse12 .cse19 .cse13)) .cse5) (and .cse1 .cse22 .cse4 .cse16) (and .cse9 .cse1 .cse30 .cse2 (< 0 .cse27)) (and .cse20 .cse7 .cse14 .cse13) (and (exists ((v_~a29~0_902 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_902 299978) 300021)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902))) (or (and .cse20 .cse17 .cse14) (and .cse18 .cse7 .cse17 (exists ((v_prenex_1 Int)) (let ((.cse31 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse31) (<= ~a29~0 (+ (mod .cse31 29) 14))))) .cse11))) (and .cse20 .cse3 .cse16 .cse14) (and .cse1 .cse9 .cse7 .cse13 .cse11) (and .cse26 .cse10) (and .cse1 .cse22 .cse23 .cse24 .cse5 .cse13))))) [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,634 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,635 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,636 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,637 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse33 (+ ~a0~0 147)) (.cse34 (+ ~a4~0 86)) (.cse35 (+ ~a0~0 98)) (.cse16 (= 3 ~a2~0))) (let ((.cse8 (= 4 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse28 (<= 0 (+ ~a0~0 44))) (.cse24 (not .cse16)) (.cse0 (<= .cse35 0)) (.cse29 (+ ~a29~0 127)) (.cse20 (<= .cse34 0)) (.cse22 (<= .cse33 0)) (.cse32 (+ ~a4~0 42))) (let ((.cse6 (<= ~a29~0 42)) (.cse21 (< 0 (+ ~a29~0 16))) (.cse25 (or .cse20 .cse22 (< 0 .cse32) (not (= 2 ULTIMATE.start_calculate_output_~input)) (< 0 .cse35))) (.cse15 (<= (+ ~a0~0 104) 0)) (.cse12 (<= (+ ~a0~0 148) 0)) (.cse19 (<= .cse29 0)) (.cse4 (<= ~a29~0 43)) (.cse30 (< 0 .cse34)) (.cse27 (+ ~a29~0 144)) (.cse18 (or .cse20 .cse0)) (.cse17 (= 2 ~a2~0)) (.cse3 (< 0 .cse33)) (.cse14 (< 43 ~a29~0)) (.cse9 (<= ~a29~0 41)) (.cse7 (or (and .cse28 .cse24) (and .cse20 .cse24))) (.cse11 (<= 0 (+ ~a29~0 192415))) (.cse26 (or (and .cse2 .cse28) (and .cse20 .cse2))) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse1 (<= .cse32 0)) (.cse23 (not .cse8)) (.cse5 (<= 0 (+ ~a29~0 600000))) (.cse13 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse1 .cse6 .cse12 .cse13 .cse11) (and .cse1 .cse2 .cse12 .cse14) (and .cse1 (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) .cse15 .cse16) (and .cse0 .cse1 (<= ~a29~0 599998) .cse17 .cse14) (and .cse18 .cse7 .cse17 .cse19 .cse5) (and .cse20 .cse19 .cse5 .cse13 (<= ~a2~0 4)) (and .cse1 .cse21 .cse22 .cse17) (and .cse7 .cse17 .cse10) (and .cse9 .cse1 .cse0 .cse23 .cse24 .cse5 .cse13) (and .cse20 .cse4 .cse10 .cse13) (and .cse20 .cse9 .cse21 .cse13) (and .cse25 .cse0 .cse1 (<= 14659 ~a29~0) .cse3 .cse16) (and .cse1 (or (and .cse9 .cse21 .cse18 .cse17) (and .cse25 .cse9 .cse18 .cse3 .cse17 .cse11))) (and .cse20 .cse26 (<= .cse27 0)) (and .cse1 .cse15 .cse24 .cse14 .cse13) (and .cse0 .cse1 .cse23 .cse24 .cse13 .cse14) (and (<= (+ ~a4~0 89) 0) .cse2 .cse28 .cse19 (<= 0 .cse29)) (and .cse1 (or (and .cse30 .cse12 .cse14 .cse13) (and .cse12 .cse19 .cse13)) .cse5) (and .cse1 .cse22 .cse4 .cse16) (and .cse9 .cse1 .cse30 .cse2 (< 0 .cse27)) (and .cse20 .cse7 .cse14 .cse13) (and (exists ((v_~a29~0_902 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_902 299978) 300021)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902))) (or (and .cse20 .cse17 .cse14) (and .cse18 .cse7 .cse17 (exists ((v_prenex_1 Int)) (let ((.cse31 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse31) (<= ~a29~0 (+ (mod .cse31 29) 14))))) .cse11))) (and .cse20 .cse3 .cse16 .cse14) (and .cse1 .cse9 .cse7 .cse13 .cse11) (and .cse26 .cse10) (and .cse1 .cse22 .cse23 .cse24 .cse5 .cse13))))) [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,638 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,639 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 11:34:59,640 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 11:34:59,641 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 11:34:59,642 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 11:34:59,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:34:59 BoogieIcfgContainer [2019-12-07 11:34:59,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:34:59,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:34:59,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:34:59,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:34:59,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:53" (3/4) ... [2019-12-07 11:34:59,686 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:34:59,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:34:59,712 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:34:59,732 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 3 <= a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((((a29 <= 41 && a4 + 42 <= 0) && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a0 + 98 <= 0) && a4 + 42 <= 0) && 14659 <= a29) && 0 < a0 + 147) && 3 == a2)) || (a4 + 42 <= 0 && ((((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415)))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && 43 < a29) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || ((\exists v_~a29~0_902 : int :: (a29 <= v_~a29~0_902 % 299978 + 300021 && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && (((a4 + 86 <= 0 && 2 == a2) && 43 < a29) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)))) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 3 <= a2) && 0 <= a29 + 192415)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) [2019-12-07 11:34:59,734 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 3 <= a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((((a29 <= 41 && a4 + 42 <= 0) && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a0 + 98 <= 0) && a4 + 42 <= 0) && 14659 <= a29) && 0 < a0 + 147) && 3 == a2)) || (a4 + 42 <= 0 && ((((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415)))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && 43 < a29) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || ((\exists v_~a29~0_902 : int :: (a29 <= v_~a29~0_902 % 299978 + 300021 && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && (((a4 + 86 <= 0 && 2 == a2) && 43 < a29) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)))) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 3 <= a2) && 0 <= a29 + 192415)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) [2019-12-07 11:34:59,743 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) || ((a4 + 86 <= 0 && 1 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || (((((a4 + 42 <= 0 && (0 < a0 + 147 || !(1 == input))) && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 0 <= a29 + 192415) && 3 <= a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((((((a0 + 98 <= 0 && a29 <= 41) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && a4 + 42 <= 0) && 0 < a0 + 147) && 2 == a2) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input))) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || (((((((a0 + 98 <= 0 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 14659 <= a29) && 0 < a0 + 147) && !(4 == a2)) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input))) && 3 <= a2)) || ((((a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && a29 <= 599998) && 2 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 4 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && !(4 == a2)) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) [2019-12-07 11:34:59,831 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fe16b3d8-0102-457f-9071-4adc196dc363/bin/uautomizer/witness.graphml [2019-12-07 11:34:59,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:34:59,832 INFO L168 Benchmark]: Toolchain (without parser) took 309289.42 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 805.3 MB). Free memory was 937.0 MB in the beginning and 1.5 GB in the end (delta: -606.7 MB). Peak memory consumption was 198.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,832 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:59,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.0 GB in the end (delta: -78.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,833 INFO L168 Benchmark]: Boogie Preprocessor took 119.83 ms. Allocated memory is still 1.1 GB. Free memory was 978.3 MB in the beginning and 956.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,833 INFO L168 Benchmark]: RCFGBuilder took 1658.76 ms. Allocated memory is still 1.1 GB. Free memory was 956.8 MB in the beginning and 890.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,834 INFO L168 Benchmark]: TraceAbstraction took 306543.98 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 706.2 MB). Free memory was 890.6 MB in the beginning and 1.6 GB in the end (delta: -699.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,834 INFO L168 Benchmark]: Witness Printer took 148.44 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:59,835 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 937.0 MB in the beginning and 1.0 GB in the end (delta: -78.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.83 ms. Allocated memory is still 1.1 GB. Free memory was 978.3 MB in the beginning and 956.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1658.76 ms. Allocated memory is still 1.1 GB. Free memory was 956.8 MB in the beginning and 890.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 306543.98 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 706.2 MB). Free memory was 890.6 MB in the beginning and 1.6 GB in the end (delta: -699.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 148.44 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 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_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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: 1766]: Loop Invariant [2019-12-07 11:34:59,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 3 <= a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((((a29 <= 41 && a4 + 42 <= 0) && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a0 + 98 <= 0) && a4 + 42 <= 0) && 14659 <= a29) && 0 < a0 + 147) && 3 == a2)) || (a4 + 42 <= 0 && ((((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415)))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && 43 < a29) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || ((\exists v_~a29~0_902 : int :: (a29 <= v_~a29~0_902 % 299978 + 300021 && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && (((a4 + 86 <= 0 && 2 == a2) && 43 < a29) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)))) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 3 <= a2) && 0 <= a29 + 192415)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 11:34:59,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 3 <= a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((((a29 <= 41 && a4 + 42 <= 0) && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a0 + 98 <= 0) && a4 + 42 <= 0) && 14659 <= a29) && 0 < a0 + 147) && 3 == a2)) || (a4 + 42 <= 0 && ((((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415)))) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || ((((a4 + 42 <= 0 && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && 43 < a29) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || ((\exists v_~a29~0_902 : int :: (a29 <= v_~a29~0_902 % 299978 + 300021 && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && (((a4 + 86 <= 0 && 2 == a2) && 43 < a29) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)))) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 3 <= a2) && 0 <= a29 + 192415)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 61 <= 0)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 11:34:59,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-12-07 11:34:59,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-12-07 11:34:59,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 11:34:59,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a29 <= 41) && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) || ((a4 + 86 <= 0 && 1 == a2) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a29 <= 43) && 0 <= a29 + 600000)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((((a29 <= 41 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0) && 0 <= a29 + 192415)) || (((((a4 + 42 <= 0 && (0 < a0 + 147 || !(1 == input))) && a0 + 104 <= 0) && !(3 == a2)) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && 1 == a2) && a0 + 148 <= 0) && 43 < a29)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021)) && a0 + 104 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 0 <= a29 + 192415) && 3 <= a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((a4 + 86 <= 0 && a29 <= 43) && a0 + 61 <= 0) && 3 <= a2)) || ((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || (((((((a0 + 98 <= 0 && a29 <= 41) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && a4 + 42 <= 0) && 0 < a0 + 147) && 2 == a2) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input))) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((a4 + 86 <= 0 && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 43 < a29) && 3 <= a2)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2) && 43 < a29)) || (((((((a0 + 98 <= 0 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 14659 <= a29) && 0 < a0 + 147) && !(4 == a2)) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input))) && 3 <= a2)) || ((((a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && a29 <= 599998) && 2 == a2) && 43 < a29)) || ((((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0) && 4 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((((0 < a4 + 86 && a0 + 148 <= 0) && !(4 == a2)) && 3 <= a2) || ((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2))) && 0 <= a29 + 600000)) || (((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 600000) && 3 <= a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 266.4s, OverallIterations: 22, TraceHistogramMax: 7, AutomataDifference: 219.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.9s, HoareTripleCheckerStatistics: 5059 SDtfs, 67791 SDslu, 3355 SDs, 0 SdLazy, 148474 SolverSat, 10178 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 168.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11438 GetRequests, 10915 SyntacticMatches, 40 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12080 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20347occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 59367 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 371 NumberOfFragments, 2717 HoareAnnotationTreeSize, 4 FomulaSimplifications, 10831907 FormulaSimplificationTreeSizeReduction, 5.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1749614 FormulaSimplificationTreeSizeReductionInter, 34.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 26128 NumberOfCodeBlocks, 26128 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 26092 ConstructedInterpolants, 648 QuantifiedInterpolants, 133313479 SizeOfPredicates, 35 NumberOfNonLiveVariables, 12500 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 31369/34588 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...