./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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 470b628433c20f1f4cfd605e13f92536d937b372 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:55:59,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:55:59,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:55:59,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:55:59,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:55:59,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:55:59,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:55:59,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:55:59,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:55:59,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:55:59,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:55:59,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:55:59,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:55:59,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:55:59,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:55:59,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:55:59,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:55:59,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:55:59,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:55:59,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:55:59,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:55:59,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:55:59,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:55:59,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:55:59,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:55:59,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:55:59,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:55:59,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:55:59,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:55:59,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:55:59,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:55:59,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:55:59,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:55:59,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:55:59,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:55:59,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:55:59,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:55:59,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:55:59,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:55:59,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:55:59,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:55:59,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:55:59,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:55:59,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:55:59,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:55:59,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:55:59,689 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:55:59,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:55:59,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:55:59,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:55:59,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:55:59,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:55:59,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:55:59,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:55:59,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:55:59,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:55:59,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:55:59,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:55:59,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:55:59,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:55:59,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:55:59,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:55:59,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:55:59,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:55:59,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:55:59,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:55:59,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:55:59,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:55:59,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:55:59,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:55:59,694 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_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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 -> 470b628433c20f1f4cfd605e13f92536d937b372 [2019-11-20 05:55:59,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:55:59,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:55:59,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:55:59,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:55:59,844 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:55:59,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-11-20 05:55:59,893 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/data/ce67a9340/2c9e0b7a8e654479a878af6d03d42784/FLAGf4fd324c4 [2019-11-20 05:56:00,505 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:56:00,506 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-11-20 05:56:00,529 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/data/ce67a9340/2c9e0b7a8e654479a878af6d03d42784/FLAGf4fd324c4 [2019-11-20 05:56:00,913 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/data/ce67a9340/2c9e0b7a8e654479a878af6d03d42784 [2019-11-20 05:56:00,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:56:00,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:56:00,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:56:00,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:56:00,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:56:00,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:00" (1/1) ... [2019-11-20 05:56:00,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314bd9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:00, skipping insertion in model container [2019-11-20 05:56:00,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:56:00" (1/1) ... [2019-11-20 05:56:00,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:56:01,005 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:56:01,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:56:01,797 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:56:02,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:56:02,095 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:56:02,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02 WrapperNode [2019-11-20 05:56:02,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:56:02,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:56:02,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:56:02,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:56:02,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:56:02,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:56:02,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:56:02,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:56:02,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... [2019-11-20 05:56:02,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:56:02,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:56:02,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:56:02,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:56:02,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:56:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:56:02,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:56:05,461 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:56:05,462 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 05:56:05,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:05 BoogieIcfgContainer [2019-11-20 05:56:05,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:56:05,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:56:05,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:56:05,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:56:05,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:56:00" (1/3) ... [2019-11-20 05:56:05,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c61eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:05, skipping insertion in model container [2019-11-20 05:56:05,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:56:02" (2/3) ... [2019-11-20 05:56:05,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c61eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:56:05, skipping insertion in model container [2019-11-20 05:56:05,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:05" (3/3) ... [2019-11-20 05:56:05,471 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2019-11-20 05:56:05,479 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:56:05,486 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:56:05,496 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:56:05,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:56:05,534 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:56:05,534 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:56:05,534 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:56:05,534 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:56:05,534 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:56:05,534 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:56:05,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:56:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 05:56:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 05:56:05,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:05,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:05,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-11-20 05:56:05,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:05,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995432067] [2019-11-20 05:56:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:05,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995432067] [2019-11-20 05:56:05,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:05,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:56:05,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956269929] [2019-11-20 05:56:05,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:56:05,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:56:05,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:56:05,883 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 05:56:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:10,026 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-20 05:56:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:56:10,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-20 05:56:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:10,051 INFO L225 Difference]: With dead ends: 1466 [2019-11-20 05:56:10,051 INFO L226 Difference]: Without dead ends: 974 [2019-11-20 05:56:10,056 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-11-20 05:56:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-20 05:56:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-20 05:56:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-20 05:56:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-20 05:56:10,141 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 53 [2019-11-20 05:56:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:10,141 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-20 05:56:10,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:56:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-20 05:56:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 05:56:10,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:10,147 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, 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] [2019-11-20 05:56:10,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:10,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1371805199, now seen corresponding path program 1 times [2019-11-20 05:56:10,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:10,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346207073] [2019-11-20 05:56:10,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:10,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346207073] [2019-11-20 05:56:10,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:10,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:56:10,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994951120] [2019-11-20 05:56:10,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:56:10,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:56:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:56:10,311 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-11-20 05:56:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:13,872 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2019-11-20 05:56:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:56:13,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 05:56:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:13,888 INFO L225 Difference]: With dead ends: 3751 [2019-11-20 05:56:13,888 INFO L226 Difference]: Without dead ends: 2781 [2019-11-20 05:56:13,893 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-11-20 05:56:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-11-20 05:56:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2019-11-20 05:56:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-11-20 05:56:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2019-11-20 05:56:13,963 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 118 [2019-11-20 05:56:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:13,965 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2019-11-20 05:56:13,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:56:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2019-11-20 05:56:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 05:56:13,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:13,982 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:13,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 687400732, now seen corresponding path program 1 times [2019-11-20 05:56:13,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:13,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548059336] [2019-11-20 05:56:13,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 05:56:14,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548059336] [2019-11-20 05:56:14,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405607621] [2019-11-20 05:56:14,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:14,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:56:14,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:14,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:56:14,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 05:56:14,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254889514] [2019-11-20 05:56:14,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:14,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:56:14,644 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 3 states. [2019-11-20 05:56:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:16,508 INFO L93 Difference]: Finished difference Result 7345 states and 9794 transitions. [2019-11-20 05:56:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:16,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-20 05:56:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:16,537 INFO L225 Difference]: With dead ends: 7345 [2019-11-20 05:56:16,537 INFO L226 Difference]: Without dead ends: 4870 [2019-11-20 05:56:16,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:56:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-20 05:56:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 2775. [2019-11-20 05:56:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-20 05:56:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2019-11-20 05:56:16,630 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 263 [2019-11-20 05:56:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:16,632 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2019-11-20 05:56:16,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2019-11-20 05:56:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-20 05:56:16,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:16,638 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:16,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:16,841 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -628651217, now seen corresponding path program 1 times [2019-11-20 05:56:16,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:16,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324756803] [2019-11-20 05:56:16,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 05:56:17,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324756803] [2019-11-20 05:56:17,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:17,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:56:17,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899067076] [2019-11-20 05:56:17,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:56:17,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:17,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:56:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:56:17,489 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2019-11-20 05:56:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:21,635 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2019-11-20 05:56:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:56:21,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2019-11-20 05:56:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:21,656 INFO L225 Difference]: With dead ends: 6746 [2019-11-20 05:56:21,656 INFO L226 Difference]: Without dead ends: 3973 [2019-11-20 05:56:21,660 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-11-20 05:56:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-11-20 05:56:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-11-20 05:56:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-11-20 05:56:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2019-11-20 05:56:21,727 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 330 [2019-11-20 05:56:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2019-11-20 05:56:21,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:56:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2019-11-20 05:56:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-11-20 05:56:21,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:21,736 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:21,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash 424213697, now seen corresponding path program 1 times [2019-11-20 05:56:21,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:21,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320538552] [2019-11-20 05:56:21,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:22,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320538552] [2019-11-20 05:56:22,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469614007] [2019-11-20 05:56:22,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:22,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:56:22,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:22,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:56:22,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 05:56:22,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377129993] [2019-11-20 05:56:22,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:22,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:56:22,923 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 3 states. [2019-11-20 05:56:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:25,002 INFO L93 Difference]: Finished difference Result 7344 states and 9242 transitions. [2019-11-20 05:56:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:25,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-11-20 05:56:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:25,022 INFO L225 Difference]: With dead ends: 7344 [2019-11-20 05:56:25,022 INFO L226 Difference]: Without dead ends: 3673 [2019-11-20 05:56:25,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 404 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:56:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-11-20 05:56:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2019-11-20 05:56:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2019-11-20 05:56:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4356 transitions. [2019-11-20 05:56:25,166 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4356 transitions. Word has length 404 [2019-11-20 05:56:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:25,167 INFO L462 AbstractCegarLoop]: Abstraction has 3671 states and 4356 transitions. [2019-11-20 05:56:25,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4356 transitions. [2019-11-20 05:56:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 05:56:25,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:25,175 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, 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, 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] [2019-11-20 05:56:25,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:25,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1079722266, now seen corresponding path program 1 times [2019-11-20 05:56:25,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:25,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709480707] [2019-11-20 05:56:25,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 05:56:25,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709480707] [2019-11-20 05:56:25,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:25,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:56:25,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64332454] [2019-11-20 05:56:25,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:56:25,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:56:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:56:25,700 INFO L87 Difference]: Start difference. First operand 3671 states and 4356 transitions. Second operand 4 states. [2019-11-20 05:56:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:28,664 INFO L93 Difference]: Finished difference Result 9137 states and 11217 transitions. [2019-11-20 05:56:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:56:28,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-20 05:56:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:28,689 INFO L225 Difference]: With dead ends: 9137 [2019-11-20 05:56:28,689 INFO L226 Difference]: Without dead ends: 5468 [2019-11-20 05:56:28,693 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-11-20 05:56:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-11-20 05:56:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5467. [2019-11-20 05:56:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2019-11-20 05:56:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 6522 transitions. [2019-11-20 05:56:28,775 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 6522 transitions. Word has length 421 [2019-11-20 05:56:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:28,776 INFO L462 AbstractCegarLoop]: Abstraction has 5467 states and 6522 transitions. [2019-11-20 05:56:28,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:56:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 6522 transitions. [2019-11-20 05:56:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-11-20 05:56:28,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:28,788 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, 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, 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] [2019-11-20 05:56:28,789 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1964586309, now seen corresponding path program 1 times [2019-11-20 05:56:28,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:28,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81110280] [2019-11-20 05:56:28,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-20 05:56:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81110280] [2019-11-20 05:56:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:56:29,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330787798] [2019-11-20 05:56:29,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:29,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:56:29,334 INFO L87 Difference]: Start difference. First operand 5467 states and 6522 transitions. Second operand 3 states. [2019-11-20 05:56:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:31,271 INFO L93 Difference]: Finished difference Result 12725 states and 15454 transitions. [2019-11-20 05:56:31,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:31,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2019-11-20 05:56:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:31,300 INFO L225 Difference]: With dead ends: 12725 [2019-11-20 05:56:31,300 INFO L226 Difference]: Without dead ends: 7260 [2019-11-20 05:56:31,306 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-11-20 05:56:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-11-20 05:56:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7260. [2019-11-20 05:56:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-11-20 05:56:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 8644 transitions. [2019-11-20 05:56:31,417 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 8644 transitions. Word has length 517 [2019-11-20 05:56:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:31,418 INFO L462 AbstractCegarLoop]: Abstraction has 7260 states and 8644 transitions. [2019-11-20 05:56:31,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 8644 transitions. [2019-11-20 05:56:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-20 05:56:31,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:31,434 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, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:31,434 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash 667607770, now seen corresponding path program 1 times [2019-11-20 05:56:31,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:31,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011791036] [2019-11-20 05:56:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 634 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-20 05:56:32,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011791036] [2019-11-20 05:56:32,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190722840] [2019-11-20 05:56:32,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:33,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:56:33,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:56:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-20 05:56:33,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:56:33,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 05:56:33,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718721283] [2019-11-20 05:56:33,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 05:56:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 05:56:33,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:56:33,789 INFO L87 Difference]: Start difference. First operand 7260 states and 8644 transitions. Second operand 9 states. [2019-11-20 05:56:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:39,366 INFO L93 Difference]: Finished difference Result 19457 states and 22803 transitions. [2019-11-20 05:56:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 05:56:39,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 608 [2019-11-20 05:56:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:39,381 INFO L225 Difference]: With dead ends: 19457 [2019-11-20 05:56:39,382 INFO L226 Difference]: Without dead ends: 9053 [2019-11-20 05:56:39,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-20 05:56:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-11-20 05:56:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 6660. [2019-11-20 05:56:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-20 05:56:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7156 transitions. [2019-11-20 05:56:39,479 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7156 transitions. Word has length 608 [2019-11-20 05:56:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:39,480 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7156 transitions. [2019-11-20 05:56:39,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 05:56:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7156 transitions. [2019-11-20 05:56:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-11-20 05:56:39,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:39,488 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:56:39,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:39,792 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash -450281948, now seen corresponding path program 1 times [2019-11-20 05:56:39,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:39,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065467796] [2019-11-20 05:56:39,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-20 05:56:40,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065467796] [2019-11-20 05:56:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:40,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:56:40,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995535129] [2019-11-20 05:56:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:40,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:56:40,241 INFO L87 Difference]: Start difference. First operand 6660 states and 7156 transitions. Second operand 3 states. [2019-11-20 05:56:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:41,548 INFO L93 Difference]: Finished difference Result 13316 states and 14308 transitions. [2019-11-20 05:56:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:41,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-11-20 05:56:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:41,558 INFO L225 Difference]: With dead ends: 13316 [2019-11-20 05:56:41,558 INFO L226 Difference]: Without dead ends: 6658 [2019-11-20 05:56:41,564 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-11-20 05:56:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2019-11-20 05:56:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6658. [2019-11-20 05:56:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-11-20 05:56:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7152 transitions. [2019-11-20 05:56:41,633 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7152 transitions. Word has length 650 [2019-11-20 05:56:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:41,634 INFO L462 AbstractCegarLoop]: Abstraction has 6658 states and 7152 transitions. [2019-11-20 05:56:41,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7152 transitions. [2019-11-20 05:56:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-11-20 05:56:41,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:41,643 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:41,643 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1610580137, now seen corresponding path program 1 times [2019-11-20 05:56:41,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:41,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27452333] [2019-11-20 05:56:41,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 473 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-20 05:56:42,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27452333] [2019-11-20 05:56:42,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589219585] [2019-11-20 05:56:42,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:42,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:56:42,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-20 05:56:43,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:56:43,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 05:56:43,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370054791] [2019-11-20 05:56:43,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:43,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:56:43,268 INFO L87 Difference]: Start difference. First operand 6658 states and 7152 transitions. Second operand 3 states. [2019-11-20 05:56:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:44,152 INFO L93 Difference]: Finished difference Result 13315 states and 14304 transitions. [2019-11-20 05:56:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:44,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-11-20 05:56:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:44,163 INFO L225 Difference]: With dead ends: 13315 [2019-11-20 05:56:44,163 INFO L226 Difference]: Without dead ends: 6659 [2019-11-20 05:56:44,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 664 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:56:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-11-20 05:56:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6656. [2019-11-20 05:56:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-11-20 05:56:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7064 transitions. [2019-11-20 05:56:44,241 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7064 transitions. Word has length 663 [2019-11-20 05:56:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:44,242 INFO L462 AbstractCegarLoop]: Abstraction has 6656 states and 7064 transitions. [2019-11-20 05:56:44,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7064 transitions. [2019-11-20 05:56:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-11-20 05:56:44,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:44,253 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:44,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:44,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1841661433, now seen corresponding path program 1 times [2019-11-20 05:56:44,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:44,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601131951] [2019-11-20 05:56:44,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 81 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:56:45,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601131951] [2019-11-20 05:56:45,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047722461] [2019-11-20 05:56:45,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:45,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:56:45,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:56:46,853 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 60 DAG size of output: 17 [2019-11-20 05:56:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-20 05:56:47,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:56:47,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-20 05:56:47,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189055469] [2019-11-20 05:56:47,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:47,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:56:47,268 INFO L87 Difference]: Start difference. First operand 6656 states and 7064 transitions. Second operand 3 states. [2019-11-20 05:57:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:57:08,762 INFO L93 Difference]: Finished difference Result 17213 states and 18272 transitions. [2019-11-20 05:57:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:57:08,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-11-20 05:57:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:57:08,774 INFO L225 Difference]: With dead ends: 17213 [2019-11-20 05:57:08,774 INFO L226 Difference]: Without dead ends: 10260 [2019-11-20 05:57:08,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:57:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2019-11-20 05:57:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 9349. [2019-11-20 05:57:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9349 states. [2019-11-20 05:57:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 9901 transitions. [2019-11-20 05:57:08,878 INFO L78 Accepts]: Start accepts. Automaton has 9349 states and 9901 transitions. Word has length 685 [2019-11-20 05:57:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:57:08,879 INFO L462 AbstractCegarLoop]: Abstraction has 9349 states and 9901 transitions. [2019-11-20 05:57:08,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:57:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 9349 states and 9901 transitions. [2019-11-20 05:57:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-11-20 05:57:08,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:57:08,893 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 05:57:09,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:57:09,096 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:57:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:57:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1459953853, now seen corresponding path program 1 times [2019-11-20 05:57:09,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:57:09,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873681498] [2019-11-20 05:57:09,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:57:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:57:11,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873681498] [2019-11-20 05:57:11,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111415800] [2019-11-20 05:57:11,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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-11-20 05:57:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:12,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:57:12,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:57:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:57:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:57:14,217 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-11-20 05:57:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-20 05:57:14,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:57:14,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2019-11-20 05:57:14,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766364962] [2019-11-20 05:57:14,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:57:14,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:57:14,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:57:14,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:57:14,743 INFO L87 Difference]: Start difference. First operand 9349 states and 9901 transitions. Second operand 4 states. [2019-11-20 05:57:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:57:49,653 INFO L93 Difference]: Finished difference Result 20795 states and 22102 transitions. [2019-11-20 05:57:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:57:49,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 711 [2019-11-20 05:57:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:57:49,666 INFO L225 Difference]: With dead ends: 20795 [2019-11-20 05:57:49,666 INFO L226 Difference]: Without dead ends: 11448 [2019-11-20 05:57:49,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:57:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2019-11-20 05:57:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 10252. [2019-11-20 05:57:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10252 states. [2019-11-20 05:57:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 10813 transitions. [2019-11-20 05:57:49,779 INFO L78 Accepts]: Start accepts. Automaton has 10252 states and 10813 transitions. Word has length 711 [2019-11-20 05:57:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:57:49,779 INFO L462 AbstractCegarLoop]: Abstraction has 10252 states and 10813 transitions. [2019-11-20 05:57:49,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:57:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 10252 states and 10813 transitions. [2019-11-20 05:57:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-11-20 05:57:49,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:57:49,799 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, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:57:50,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:57:50,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:57:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:57:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1653832397, now seen corresponding path program 1 times [2019-11-20 05:57:50,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:57:50,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790512576] [2019-11-20 05:57:50,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:57:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 682 proven. 171 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-20 05:57:51,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790512576] [2019-11-20 05:57:51,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521844765] [2019-11-20 05:57:51,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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-11-20 05:57:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:51,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:57:51,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:57:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:57:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:57:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-11-20 05:57:52,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:57:52,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-20 05:57:52,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634290636] [2019-11-20 05:57:52,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:57:52,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:57:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:57:52,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:57:52,799 INFO L87 Difference]: Start difference. First operand 10252 states and 10813 transitions. Second operand 4 states. [2019-11-20 05:57:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:57:54,770 INFO L93 Difference]: Finished difference Result 25901 states and 27388 transitions. [2019-11-20 05:57:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:57:54,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 838 [2019-11-20 05:57:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:57:54,784 INFO L225 Difference]: With dead ends: 25901 [2019-11-20 05:57:54,784 INFO L226 Difference]: Without dead ends: 15651 [2019-11-20 05:57:54,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 837 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:57:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15651 states. [2019-11-20 05:57:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15651 to 13251. [2019-11-20 05:57:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-20 05:57:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 13899 transitions. [2019-11-20 05:57:54,925 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 13899 transitions. Word has length 838 [2019-11-20 05:57:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:57:54,926 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 13899 transitions. [2019-11-20 05:57:54,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:57:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 13899 transitions. [2019-11-20 05:57:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2019-11-20 05:57:54,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:57:54,950 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:57:55,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:57:55,154 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:57:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:57:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1916669849, now seen corresponding path program 1 times [2019-11-20 05:57:55,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:57:55,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894421172] [2019-11-20 05:57:55,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:57:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-11-20 05:57:56,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894421172] [2019-11-20 05:57:56,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:57:56,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:57:56,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628448334] [2019-11-20 05:57:56,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:57:56,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:57:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:57:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:57:56,030 INFO L87 Difference]: Start difference. First operand 13251 states and 13899 transitions. Second operand 3 states. [2019-11-20 05:57:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:57:56,849 INFO L93 Difference]: Finished difference Result 21671 states and 22759 transitions. [2019-11-20 05:57:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:57:56,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 892 [2019-11-20 05:57:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:57:56,858 INFO L225 Difference]: With dead ends: 21671 [2019-11-20 05:57:56,858 INFO L226 Difference]: Without dead ends: 10819 [2019-11-20 05:57:56,863 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-11-20 05:57:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2019-11-20 05:57:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10221. [2019-11-20 05:57:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10221 states. [2019-11-20 05:57:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10221 states to 10221 states and 10612 transitions. [2019-11-20 05:57:56,956 INFO L78 Accepts]: Start accepts. Automaton has 10221 states and 10612 transitions. Word has length 892 [2019-11-20 05:57:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:57:56,957 INFO L462 AbstractCegarLoop]: Abstraction has 10221 states and 10612 transitions. [2019-11-20 05:57:56,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:57:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10221 states and 10612 transitions. [2019-11-20 05:57:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2019-11-20 05:57:56,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:57:56,976 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 05:57:56,976 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:57:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:57:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -196750209, now seen corresponding path program 1 times [2019-11-20 05:57:56,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:57:56,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262708434] [2019-11-20 05:57:56,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:57:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:57:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-11-20 05:57:57,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262708434] [2019-11-20 05:57:57,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:57:57,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:57:57,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311226431] [2019-11-20 05:57:57,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:57:57,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:57:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:57:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:57:57,627 INFO L87 Difference]: Start difference. First operand 10221 states and 10612 transitions. Second operand 3 states. [2019-11-20 05:57:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:57:58,450 INFO L93 Difference]: Finished difference Result 19836 states and 20656 transitions. [2019-11-20 05:57:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:57:58,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 925 [2019-11-20 05:57:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:57:58,461 INFO L225 Difference]: With dead ends: 19836 [2019-11-20 05:57:58,461 INFO L226 Difference]: Without dead ends: 12014 [2019-11-20 05:57:58,466 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-11-20 05:57:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2019-11-20 05:57:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11715. [2019-11-20 05:57:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11715 states. [2019-11-20 05:57:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11715 states to 11715 states and 12154 transitions. [2019-11-20 05:57:58,575 INFO L78 Accepts]: Start accepts. Automaton has 11715 states and 12154 transitions. Word has length 925 [2019-11-20 05:57:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:57:58,575 INFO L462 AbstractCegarLoop]: Abstraction has 11715 states and 12154 transitions. [2019-11-20 05:57:58,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:57:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11715 states and 12154 transitions. [2019-11-20 05:57:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2019-11-20 05:57:58,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:57:58,651 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:57:58,651 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:57:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:57:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash -634879843, now seen corresponding path program 1 times [2019-11-20 05:57:58,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:57:58,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929309729] [2019-11-20 05:57:58,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:57:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 262 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:58:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929309729] [2019-11-20 05:58:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287390592] [2019-11-20 05:58:01,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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-11-20 05:58:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:01,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:58:01,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:58:01,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:58:01,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:58:02,934 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_828 Int)) (and (<= (+ v_~a0~0_828 44) 0) (<= 0 v_~a0~0_828) (<= (mod v_~a0~0_828 299926) (+ c_~a0~0 300074)))) (exists ((v_~a0~0_828 Int)) (let ((.cse0 (mod v_~a0~0_828 299926))) (and (not (= 0 .cse0)) (<= (+ v_~a0~0_828 44) 0) (< v_~a0~0_828 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_~a0~0_828 Int)) (let ((.cse1 (mod v_~a0~0_828 299926))) (and (<= (+ v_~a0~0_828 44) 0) (= 0 .cse1) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2019-11-20 05:58:03,882 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_828 Int)) (and (<= (+ v_~a0~0_828 44) 0) (<= 0 v_~a0~0_828) (<= (mod v_~a0~0_828 299926) (+ c_~a0~0 300074)))) (exists ((v_prenex_3 Int)) (let ((.cse0 (mod v_prenex_3 299926))) (and (<= (+ v_prenex_3 44) 0) (<= .cse0 (+ c_~a0~0 300074)) (= 0 .cse0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 600000)) (not (= 0 .cse1)))))) is different from true [2019-11-20 05:58:04,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:58:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 480 trivial. 640 not checked. [2019-11-20 05:58:07,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:58:07,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-11-20 05:58:07,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844772319] [2019-11-20 05:58:07,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:58:07,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:58:07,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:58:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=113, Unknown=2, NotChecked=46, Total=210 [2019-11-20 05:58:07,916 INFO L87 Difference]: Start difference. First operand 11715 states and 12154 transitions. Second operand 15 states. [2019-11-20 05:58:15,879 WARN L191 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2019-11-20 05:58:22,580 WARN L191 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-20 05:58:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:58:36,237 INFO L93 Difference]: Finished difference Result 42275 states and 43848 transitions. [2019-11-20 05:58:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 05:58:36,237 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 946 [2019-11-20 05:58:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:58:36,254 INFO L225 Difference]: With dead ends: 42275 [2019-11-20 05:58:36,254 INFO L226 Difference]: Without dead ends: 30861 [2019-11-20 05:58:36,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 943 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=257, Invalid=936, Unknown=5, NotChecked=134, Total=1332 [2019-11-20 05:58:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30861 states. [2019-11-20 05:58:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30861 to 16210. [2019-11-20 05:58:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16210 states. [2019-11-20 05:58:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16210 states to 16210 states and 16819 transitions. [2019-11-20 05:58:36,448 INFO L78 Accepts]: Start accepts. Automaton has 16210 states and 16819 transitions. Word has length 946 [2019-11-20 05:58:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:58:36,449 INFO L462 AbstractCegarLoop]: Abstraction has 16210 states and 16819 transitions. [2019-11-20 05:58:36,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:58:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16210 states and 16819 transitions. [2019-11-20 05:58:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2019-11-20 05:58:36,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:58:36,468 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, 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, 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, 3, 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-11-20 05:58:36,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:58:36,671 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:58:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:58:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash 375105591, now seen corresponding path program 1 times [2019-11-20 05:58:36,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:58:36,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095919604] [2019-11-20 05:58:36,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:58:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 122 proven. 1240 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-11-20 05:58:39,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095919604] [2019-11-20 05:58:39,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517303553] [2019-11-20 05:58:39,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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-11-20 05:58:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:39,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 05:58:39,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:58:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 102 proven. 1260 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2019-11-20 05:58:41,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:58:41,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-20 05:58:41,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627364314] [2019-11-20 05:58:41,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 05:58:41,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:58:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 05:58:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:58:41,316 INFO L87 Difference]: Start difference. First operand 16210 states and 16819 transitions. Second operand 9 states. [2019-11-20 05:58:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:58:44,010 INFO L93 Difference]: Finished difference Result 23711 states and 24619 transitions. [2019-11-20 05:58:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:58:44,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1185 [2019-11-20 05:58:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:58:44,021 INFO L225 Difference]: With dead ends: 23711 [2019-11-20 05:58:44,022 INFO L226 Difference]: Without dead ends: 23709 [2019-11-20 05:58:44,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:58:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23709 states. [2019-11-20 05:58:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23709 to 20707. [2019-11-20 05:58:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20707 states. [2019-11-20 05:58:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20707 states to 20707 states and 21517 transitions. [2019-11-20 05:58:44,202 INFO L78 Accepts]: Start accepts. Automaton has 20707 states and 21517 transitions. Word has length 1185 [2019-11-20 05:58:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:58:44,203 INFO L462 AbstractCegarLoop]: Abstraction has 20707 states and 21517 transitions. [2019-11-20 05:58:44,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 05:58:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20707 states and 21517 transitions. [2019-11-20 05:58:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2019-11-20 05:58:44,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:58:44,240 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 05:58:44,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:58:44,453 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:58:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:58:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1817558120, now seen corresponding path program 1 times [2019-11-20 05:58:44,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:58:44,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923929831] [2019-11-20 05:58:44,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:58:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6730 backedges. 3560 proven. 198 refuted. 0 times theorem prover too weak. 2972 trivial. 0 not checked. [2019-11-20 05:58:47,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923929831] [2019-11-20 05:58:47,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753050825] [2019-11-20 05:58:47,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/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-11-20 05:58:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:48,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 2190 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:58:48,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:58:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6730 backedges. 3626 proven. 0 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2019-11-20 05:58:49,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:58:49,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 05:58:49,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414307272] [2019-11-20 05:58:49,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:58:49,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:58:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:58:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:58:49,837 INFO L87 Difference]: Start difference. First operand 20707 states and 21517 transitions. Second operand 3 states. [2019-11-20 05:58:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:58:50,764 INFO L93 Difference]: Finished difference Result 40814 states and 42427 transitions. [2019-11-20 05:58:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:58:50,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1908 [2019-11-20 05:58:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:58:50,781 INFO L225 Difference]: With dead ends: 40814 [2019-11-20 05:58:50,781 INFO L226 Difference]: Without dead ends: 20707 [2019-11-20 05:58:50,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1921 GetRequests, 1909 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-11-20 05:58:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20707 states. [2019-11-20 05:58:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20707 to 19507. [2019-11-20 05:58:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19507 states. [2019-11-20 05:58:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 20047 transitions. [2019-11-20 05:58:50,988 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 20047 transitions. Word has length 1908 [2019-11-20 05:58:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:58:50,989 INFO L462 AbstractCegarLoop]: Abstraction has 19507 states and 20047 transitions. [2019-11-20 05:58:50,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:58:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 20047 transitions. [2019-11-20 05:58:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2248 [2019-11-20 05:58:51,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:58:51,033 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:58:51,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:58:51,240 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:58:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:58:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash -766057737, now seen corresponding path program 1 times [2019-11-20 05:58:51,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:58:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224074624] [2019-11-20 05:58:51,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:58:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:58:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8957 backedges. 5184 proven. 0 refuted. 0 times theorem prover too weak. 3773 trivial. 0 not checked. [2019-11-20 05:58:54,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224074624] [2019-11-20 05:58:54,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:58:54,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:58:54,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384770475] [2019-11-20 05:58:54,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:58:54,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:58:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:58:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:58:54,859 INFO L87 Difference]: Start difference. First operand 19507 states and 20047 transitions. Second operand 4 states. [2019-11-20 05:58:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:58:56,245 INFO L93 Difference]: Finished difference Result 47097 states and 48385 transitions. [2019-11-20 05:58:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:58:56,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2247 [2019-11-20 05:58:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:58:56,246 INFO L225 Difference]: With dead ends: 47097 [2019-11-20 05:58:56,246 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:58:56,256 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-11-20 05:58:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:58:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:58:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:58:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:58:56,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2247 [2019-11-20 05:58:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:58:56,257 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:58:56,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:58:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:58:56,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:58:56,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:58:56,945 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 356 [2019-11-20 05:58:57,435 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 452 DAG size of output: 355 [2019-11-20 05:58:57,795 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 346 [2019-11-20 05:59:00,259 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 334 DAG size of output: 142 [2019-11-20 05:59:02,558 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 334 DAG size of output: 142 [2019-11-20 05:59:05,293 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 325 DAG size of output: 137 [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,296 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,297 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,298 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 05:59:05,299 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 05:59:05,300 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 05:59:05,301 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 05:59:05,302 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,303 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,304 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,305 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,306 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:59:05,307 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 05:59:05,311 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 05:59:05,312 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 05:59:05,313 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,314 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 05:59:05,315 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 05:59:05,316 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,316 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,316 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,316 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 98)) (.cse26 (+ ~a4~0 86)) (.cse22 (+ ~a0~0 44))) (let ((.cse21 (<= 0 .cse22)) (.cse16 (<= .cse26 0)) (.cse20 (< 0 .cse24)) (.cse8 (< 0 .cse26)) (.cse2 (= 1 ~a2~0)) (.cse18 (< 0 (+ ~a29~0 144)))) (let ((.cse4 (not (= 5 ~a2~0))) (.cse12 (and .cse8 .cse2 (<= ~a29~0 43) .cse18)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse25 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse25) (<= (+ ~a0~0 300075) .cse25))))) (.cse15 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse5 (<= 4 ~a2~0)) (.cse3 (< 0 (+ ~a0~0 147))) (.cse7 (<= 2 ~a2~0)) (.cse0 (<= .cse24 0)) (.cse11 (<= ~a2~0 2)) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (or .cse21 (and .cse16 (not (= 2 ~a2~0))) (and .cse16 .cse20))) (.cse10 (exists ((v_prenex_1 Int)) (let ((.cse23 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse23) (<= ~a29~0 (+ (mod .cse23 29) 14)))))) (.cse17 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5 .cse6) (and .cse7 (<= 280404 ~a29~0) .cse0 .cse1 .cse8) (and (and .cse4 .cse1 .cse9 .cse10) .cse5) (and (and .cse7 .cse11 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse7 .cse1 .cse11 .cse9) (and .cse15 (and .cse7 .cse1 .cse9 .cse10)) (and .cse15 (and .cse7 .cse16 .cse9)) (and .cse0 .cse1 .cse17) (and .cse0 .cse1 .cse15 .cse2 .cse14) (and .cse12 .cse1 .cse15) (and .cse7 .cse1 .cse0 .cse11 .cse15 .cse10) (and .cse1 .cse2 .cse18 .cse10 .cse19 .cse20) (and .cse1 .cse13 .cse5 .cse14) (and .cse0 .cse1 .cse15 .cse5 .cse14) (and .cse7 .cse16 .cse11 .cse10) (and .cse9 .cse19) (and .cse0 .cse1 .cse5 .cse3) (and .cse7 .cse0 .cse1 .cse8 .cse11 .cse6) (and (<= (+ ~a4~0 89) 0) .cse2 .cse21 .cse10 (<= .cse22 0) (<= 0 (+ ~a29~0 127))) (and .cse1 .cse9 .cse10 .cse17))))) [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,317 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 05:59:05,318 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,319 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 05:59:05,320 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,321 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,322 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse22 (+ ~a29~0 144)) (.cse28 (+ ~a4~0 86)) (.cse24 (+ ~a0~0 44)) (.cse26 (+ ~a0~0 98))) (let ((.cse20 (< 0 .cse26)) (.cse23 (<= 0 .cse24)) (.cse16 (<= .cse28 0)) (.cse8 (< 0 .cse28)) (.cse2 (= 1 ~a2~0)) (.cse18 (< 0 .cse22))) (let ((.cse4 (not (= 5 ~a2~0))) (.cse12 (and .cse8 .cse2 (<= ~a29~0 43) .cse18)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse27 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse27) (<= (+ ~a0~0 300075) .cse27))))) (.cse15 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse5 (<= 4 ~a2~0)) (.cse3 (< 0 (+ ~a0~0 147))) (.cse7 (<= 2 ~a2~0)) (.cse0 (<= .cse26 0)) (.cse11 (<= ~a2~0 2)) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse21 (or (and .cse2 .cse23) (and .cse16 .cse2))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (or .cse23 (and .cse16 (not (= 2 ~a2~0))) (and .cse16 .cse20))) (.cse10 (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)))))) (.cse17 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5 .cse6) (and .cse7 (<= 280404 ~a29~0) .cse0 .cse1 .cse8) (and (and .cse4 .cse1 .cse9 .cse10) .cse5) (and (and .cse7 .cse11 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse7 .cse1 .cse11 .cse9) (and .cse15 (and .cse7 .cse1 .cse9 .cse10)) (and .cse15 (and .cse7 .cse16 .cse9)) (and .cse0 .cse1 .cse17) (and .cse0 .cse1 .cse15 .cse2 .cse14) (and .cse12 .cse1 .cse15) (and .cse7 .cse1 .cse0 .cse11 .cse15 .cse10) (and .cse1 .cse2 .cse18 .cse10 .cse19 .cse20) (and .cse16 .cse21 (<= .cse22 0)) (and .cse1 .cse13 .cse5 .cse14) (and .cse0 .cse1 .cse15 .cse5 .cse14) (and .cse7 .cse16 .cse11 .cse10) (and .cse9 .cse19) (and .cse0 .cse1 .cse5 .cse3) (and .cse7 .cse0 .cse1 .cse8 .cse11 .cse6) (and (<= (+ ~a4~0 89) 0) .cse21 .cse23 .cse10 (<= .cse24 0) (<= 0 (+ ~a29~0 127))) (and .cse1 .cse9 .cse10 .cse17))))) [2019-11-20 05:59:05,322 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,322 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 05:59:05,322 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 05:59:05,323 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,324 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,325 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 05:59:05,326 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 05:59:05,327 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,328 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,329 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 05:59:05,330 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,331 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,331 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,331 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,331 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,331 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse22 (+ ~a29~0 144)) (.cse28 (+ ~a4~0 86)) (.cse24 (+ ~a0~0 44)) (.cse26 (+ ~a0~0 98))) (let ((.cse20 (< 0 .cse26)) (.cse23 (<= 0 .cse24)) (.cse16 (<= .cse28 0)) (.cse8 (< 0 .cse28)) (.cse2 (= 1 ~a2~0)) (.cse18 (< 0 .cse22))) (let ((.cse4 (not (= 5 ~a2~0))) (.cse12 (and .cse8 .cse2 (<= ~a29~0 43) .cse18)) (.cse13 (exists ((v_~a0~0_826 Int)) (let ((.cse27 (mod v_~a0~0_826 299926))) (and (<= (+ v_~a0~0_826 44) 0) (= 0 .cse27) (<= (+ ~a0~0 300075) .cse27))))) (.cse15 (< 0 (+ ~a29~0 16))) (.cse14 (<= 0 (+ ~a0~0 561521))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse5 (<= 4 ~a2~0)) (.cse3 (< 0 (+ ~a0~0 147))) (.cse7 (<= 2 ~a2~0)) (.cse0 (<= .cse26 0)) (.cse11 (<= ~a2~0 2)) (.cse6 (<= 0 (+ ~a0~0 595423))) (.cse21 (or (and .cse2 .cse23) (and .cse16 .cse2))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (or .cse23 (and .cse16 (not (= 2 ~a2~0))) (and .cse16 .cse20))) (.cse10 (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)))))) (.cse17 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5 .cse6) (and .cse7 (<= 280404 ~a29~0) .cse0 .cse1 .cse8) (and (and .cse4 .cse1 .cse9 .cse10) .cse5) (and (and .cse7 .cse11 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4)))))) .cse6) (and (and .cse12 .cse13 .cse1) .cse14) (and .cse7 .cse1 .cse11 .cse9) (and .cse15 (and .cse7 .cse1 .cse9 .cse10)) (and .cse15 (and .cse7 .cse16 .cse9)) (and .cse0 .cse1 .cse17) (and .cse0 .cse1 .cse15 .cse2 .cse14) (and .cse12 .cse1 .cse15) (and .cse7 .cse1 .cse0 .cse11 .cse15 .cse10) (and .cse1 .cse2 .cse18 .cse10 .cse19 .cse20) (and .cse16 .cse21 (<= .cse22 0)) (and .cse1 .cse13 .cse5 .cse14) (and .cse0 .cse1 .cse15 .cse5 .cse14) (and .cse7 .cse16 .cse11 .cse10) (and .cse9 .cse19) (and .cse0 .cse1 .cse5 .cse3) (and .cse7 .cse0 .cse1 .cse8 .cse11 .cse6) (and (<= (+ ~a4~0 89) 0) .cse21 .cse23 .cse10 (<= .cse24 0) (<= 0 (+ ~a29~0 127))) (and .cse1 .cse9 .cse10 .cse17))))) [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,332 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,333 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,334 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 05:59:05,335 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,336 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,337 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,338 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 05:59:05,339 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,340 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 05:59:05,341 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,342 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,343 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,344 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,345 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 05:59:05,345 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 05:59:05,345 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 05:59:05,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,397 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:59:05 BoogieIcfgContainer [2019-11-20 05:59:05,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:59:05,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:59:05,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:59:05,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:59:05,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:56:05" (3/4) ... [2019-11-20 05:59:05,436 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:59:05,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 05:59:05,466 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:59:05,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-20 05:59:05,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-20 05:59:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) [2019-11-20 05:59:05,657 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_14ad0528-cdc3-4a69-92ed-5a18e91c5dad/bin/uautomizer/witness.graphml [2019-11-20 05:59:05,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:59:05,658 INFO L168 Benchmark]: Toolchain (without parser) took 184742.61 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 612.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,659 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:59:05,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1178.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -78.9 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,660 INFO L168 Benchmark]: Boogie Preprocessor took 319.98 ms. Allocated memory is still 1.1 GB. Free memory was 980.8 MB in the beginning and 964.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,660 INFO L168 Benchmark]: RCFGBuilder took 2860.83 ms. Allocated memory is still 1.1 GB. Free memory was 964.1 MB in the beginning and 892.1 MB in the end (delta: 72.0 MB). Peak memory consumption was 165.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,661 INFO L168 Benchmark]: TraceAbstraction took 179968.04 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 892.1 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,661 INFO L168 Benchmark]: Witness Printer took 225.12 ms. Allocated memory is still 5.0 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:59:05,663 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1178.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -78.9 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 185.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 319.98 ms. Allocated memory is still 1.1 GB. Free memory was 980.8 MB in the beginning and 964.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2860.83 ms. Allocated memory is still 1.1 GB. Free memory was 964.1 MB in the beginning and 892.1 MB in the end (delta: 72.0 MB). Peak memory consumption was 165.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179968.04 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 892.1 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 225.12 ms. Allocated memory is still 5.0 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,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_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_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: 166]: 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-11-20 05:59:05,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,705 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) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 05:59:05,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,728 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) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 05:59:05,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:59:05,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_826,QUANTIFIED] [2019-11-20 05:59:05,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 05:59:05,747 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) || ((((!(5 == a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && 0 <= a0 + 595423)) || ((((2 <= a2 && 280404 <= a29) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || ((((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 4 <= a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 595423)) || ((((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && a4 + 42 <= 0) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (0 < a29 + 16 && ((2 <= a2 && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\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 + 16 && (2 <= a2 && a4 + 86 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && 0 <= a0 + 561521)) || (((((0 < a4 + 86 && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 < a29 + 16)) || (((((2 <= a2 && a4 + 42 <= 0) && a0 + 98 <= 0) && a2 <= 2) && 0 < a29 + 16) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a29 + 144) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 61 <= 0) && 0 < a0 + 98)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_826 : int :: (v_~a0~0_826 + 44 <= 0 && 0 == v_~a0~0_826 % 299926) && a0 + 300075 <= v_~a0~0_826 % 299926)) && 4 <= a2) && 0 <= a0 + 561521)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 4 <= a2) && 0 <= a0 + 561521)) || (((2 <= a2 && a4 + 86 <= 0) && a2 <= 2) && (\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 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147)) || (((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && 0 <= a0 + 595423)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && a0 + 44 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 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: 179.8s, OverallIterations: 19, TraceHistogramMax: 12, AutomataDifference: 122.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, HoareTripleCheckerStatistics: 4576 SDtfs, 15115 SDslu, 1181 SDs, 0 SdLazy, 44153 SolverSat, 4707 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 100.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8367 GetRequests, 8216 SyntacticMatches, 24 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20707occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 29357 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 328 NumberOfFragments, 2541 HoareAnnotationTreeSize, 4 FomulaSimplifications, 98501 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 48754 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 22575 NumberOfCodeBlocks, 22575 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 22546 ConstructedInterpolants, 543 QuantifiedInterpolants, 96293255 SizeOfPredicates, 10 NumberOfNonLiveVariables, 9556 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 36903/43280 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...