./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/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 2a7583bada7d92ecf81db6380e139f6bc8bbcd06 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:58:10,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:58:10,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:58:10,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:58:10,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:58:10,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:58:10,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:58:10,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:58:10,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:58:10,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:58:10,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:58:10,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:58:10,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:58:10,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:58:10,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:58:10,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:58:10,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:58:10,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:58:10,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:58:10,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:58:10,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:58:10,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:58:10,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:58:10,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:58:10,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:58:10,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:58:10,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:58:10,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:58:10,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:58:10,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:58:10,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:58:10,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:58:10,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:58:10,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:58:10,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:58:10,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:58:10,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:58:10,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:58:10,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:58:10,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:58:10,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:58:10,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:58:10,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:58:10,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:58:10,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:58:10,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:58:10,314 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:58:10,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:58:10,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:58:10,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:58:10,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:58:10,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:58:10,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:58:10,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:58:10,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:58:10,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:58:10,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:58:10,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:58:10,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:58:10,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:58:10,318 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_e2f6e2f1-c553-4527-b25e-420630eefe7f/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 -> 2a7583bada7d92ecf81db6380e139f6bc8bbcd06 [2019-12-07 18:58:10,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:58:10,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:58:10,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:58:10,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:58:10,429 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:58:10,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label21.c [2019-12-07 18:58:10,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/data/e49fa7b8c/42f3fe3f73c94b109199e0af30c25290/FLAGfb8508abb [2019-12-07 18:58:10,862 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:58:10,863 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/sv-benchmarks/c/eca-rers2012/Problem16_label21.c [2019-12-07 18:58:10,875 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/data/e49fa7b8c/42f3fe3f73c94b109199e0af30c25290/FLAGfb8508abb [2019-12-07 18:58:10,885 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/data/e49fa7b8c/42f3fe3f73c94b109199e0af30c25290 [2019-12-07 18:58:10,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:58:10,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:58:10,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:58:10,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:58:10,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:58:10,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:58:10" (1/1) ... [2019-12-07 18:58:10,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21328002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:10, skipping insertion in model container [2019-12-07 18:58:10,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:58:10" (1/1) ... [2019-12-07 18:58:10,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:58:10,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:58:11,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:58:11,346 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:58:11,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:58:11,489 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:58:11,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11 WrapperNode [2019-12-07 18:58:11,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:58:11,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:58:11,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:58:11,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:58:11,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:58:11,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:58:11,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:58:11,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:58:11,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... [2019-12-07 18:58:11,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:58:11,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:58:11,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:58:11,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:58:11,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:58:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:58:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:58:13,117 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:58:13,117 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:58:13,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:13 BoogieIcfgContainer [2019-12-07 18:58:13,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:58:13,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:58:13,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:58:13,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:58:13,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:58:10" (1/3) ... [2019-12-07 18:58:13,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fe1067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:58:13, skipping insertion in model container [2019-12-07 18:58:13,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:11" (2/3) ... [2019-12-07 18:58:13,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fe1067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:58:13, skipping insertion in model container [2019-12-07 18:58:13,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:13" (3/3) ... [2019-12-07 18:58:13,124 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label21.c [2019-12-07 18:58:13,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:58:13,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:58:13,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:58:13,163 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:58:13,163 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:58:13,164 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:58:13,164 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:58:13,164 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:58:13,164 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:58:13,164 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:58:13,164 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:58:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-12-07 18:58:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:58:13,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:13,188 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] [2019-12-07 18:58:13,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-12-07 18:58:13,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:13,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154141511] [2019-12-07 18:58:13,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:13,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154141511] [2019-12-07 18:58:13,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:13,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:58:13,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959471188] [2019-12-07 18:58:13,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:58:13,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:13,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:58:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:58:13,496 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 7 states. [2019-12-07 18:58:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:17,387 INFO L93 Difference]: Finished difference Result 1815 states and 3471 transitions. [2019-12-07 18:58:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:58:17,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 18:58:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:17,426 INFO L225 Difference]: With dead ends: 1815 [2019-12-07 18:58:17,427 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 18:58:17,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 18:58:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 991. [2019-12-07 18:58:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-07 18:58:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions. [2019-12-07 18:58:17,491 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 38 [2019-12-07 18:58:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:17,491 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions. [2019-12-07 18:58:17,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:58:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions. [2019-12-07 18:58:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 18:58:17,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:17,498 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:58:17,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1339527614, now seen corresponding path program 1 times [2019-12-07 18:58:17,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:17,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301845137] [2019-12-07 18:58:17,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 18:58:17,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301845137] [2019-12-07 18:58:17,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:17,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:17,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430010685] [2019-12-07 18:58:17,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:17,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:17,697 INFO L87 Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand 4 states. [2019-12-07 18:58:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:18,885 INFO L93 Difference]: Finished difference Result 2638 states and 4103 transitions. [2019-12-07 18:58:18,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:18,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-12-07 18:58:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:18,896 INFO L225 Difference]: With dead ends: 2638 [2019-12-07 18:58:18,896 INFO L226 Difference]: Without dead ends: 1649 [2019-12-07 18:58:18,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-12-07 18:58:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-12-07 18:58:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-12-07 18:58:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions. [2019-12-07 18:58:18,939 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 228 [2019-12-07 18:58:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:18,940 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions. [2019-12-07 18:58:18,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions. [2019-12-07 18:58:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-12-07 18:58:18,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:18,947 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:18,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1455088589, now seen corresponding path program 1 times [2019-12-07 18:58:18,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:18,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045468070] [2019-12-07 18:58:18,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 18:58:19,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045468070] [2019-12-07 18:58:19,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:19,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:19,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000567265] [2019-12-07 18:58:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:19,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:19,179 INFO L87 Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand 4 states. [2019-12-07 18:58:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:22,575 INFO L93 Difference]: Finished difference Result 4612 states and 6546 transitions. [2019-12-07 18:58:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:22,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-12-07 18:58:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:22,606 INFO L225 Difference]: With dead ends: 4612 [2019-12-07 18:58:22,607 INFO L226 Difference]: Without dead ends: 2636 [2019-12-07 18:58:22,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-12-07 18:58:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2019-12-07 18:58:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-12-07 18:58:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2855 transitions. [2019-12-07 18:58:22,645 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 2855 transitions. Word has length 339 [2019-12-07 18:58:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:22,645 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 2855 transitions. [2019-12-07 18:58:22,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 2855 transitions. [2019-12-07 18:58:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-12-07 18:58:22,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:22,654 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 18:58:22,654 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1707840837, now seen corresponding path program 1 times [2019-12-07 18:58:22,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:22,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103445641] [2019-12-07 18:58:22,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-12-07 18:58:23,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103445641] [2019-12-07 18:58:23,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:23,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:23,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455889020] [2019-12-07 18:58:23,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:23,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:23,058 INFO L87 Difference]: Start difference. First operand 2636 states and 2855 transitions. Second operand 4 states. [2019-12-07 18:58:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:24,262 INFO L93 Difference]: Finished difference Result 8231 states and 8981 transitions. [2019-12-07 18:58:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:24,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 615 [2019-12-07 18:58:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:24,295 INFO L225 Difference]: With dead ends: 8231 [2019-12-07 18:58:24,295 INFO L226 Difference]: Without dead ends: 5926 [2019-12-07 18:58:24,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-07 18:58:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 4939. [2019-12-07 18:58:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4939 states. [2019-12-07 18:58:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5298 transitions. [2019-12-07 18:58:24,355 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5298 transitions. Word has length 615 [2019-12-07 18:58:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:24,356 INFO L462 AbstractCegarLoop]: Abstraction has 4939 states and 5298 transitions. [2019-12-07 18:58:24,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5298 transitions. [2019-12-07 18:58:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-12-07 18:58:24,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:24,369 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 18:58:24,369 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:24,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash -276815383, now seen corresponding path program 1 times [2019-12-07 18:58:24,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:24,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962157469] [2019-12-07 18:58:24,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-12-07 18:58:24,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962157469] [2019-12-07 18:58:24,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:24,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:24,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915010183] [2019-12-07 18:58:24,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:24,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:24,729 INFO L87 Difference]: Start difference. First operand 4939 states and 5298 transitions. Second operand 4 states. [2019-12-07 18:58:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:25,912 INFO L93 Difference]: Finished difference Result 12837 states and 13876 transitions. [2019-12-07 18:58:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:25,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 678 [2019-12-07 18:58:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:25,937 INFO L225 Difference]: With dead ends: 12837 [2019-12-07 18:58:25,937 INFO L226 Difference]: Without dead ends: 8229 [2019-12-07 18:58:25,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-12-07 18:58:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-12-07 18:58:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-12-07 18:58:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8759 transitions. [2019-12-07 18:58:26,020 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8759 transitions. Word has length 678 [2019-12-07 18:58:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:26,021 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8759 transitions. [2019-12-07 18:58:26,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8759 transitions. [2019-12-07 18:58:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-12-07 18:58:26,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:26,030 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 18:58:26,030 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:26,030 INFO L82 PathProgramCache]: Analyzing trace with hash 340514409, now seen corresponding path program 1 times [2019-12-07 18:58:26,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:26,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364209150] [2019-12-07 18:58:26,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 321 proven. 243 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-12-07 18:58:26,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364209150] [2019-12-07 18:58:26,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96660328] [2019-12-07 18:58:26,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:26,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:58:27,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:58:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-12-07 18:58:27,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:58:27,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:58:27,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209369522] [2019-12-07 18:58:27,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:27,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:27,273 INFO L87 Difference]: Start difference. First operand 8229 states and 8759 transitions. Second operand 3 states. [2019-12-07 18:58:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:28,106 INFO L93 Difference]: Finished difference Result 16127 states and 17185 transitions. [2019-12-07 18:58:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:28,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 703 [2019-12-07 18:58:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:28,141 INFO L225 Difference]: With dead ends: 16127 [2019-12-07 18:58:28,141 INFO L226 Difference]: Without dead ends: 8229 [2019-12-07 18:58:28,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 703 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-12-07 18:58:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2019-12-07 18:58:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2019-12-07 18:58:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8692 transitions. [2019-12-07 18:58:28,241 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8692 transitions. Word has length 703 [2019-12-07 18:58:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:28,242 INFO L462 AbstractCegarLoop]: Abstraction has 8229 states and 8692 transitions. [2019-12-07 18:58:28,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8692 transitions. [2019-12-07 18:58:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2019-12-07 18:58:28,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:28,252 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:28,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:28,453 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1714990728, now seen corresponding path program 1 times [2019-12-07 18:58:28,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:28,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736458302] [2019-12-07 18:58:28,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-12-07 18:58:29,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736458302] [2019-12-07 18:58:29,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:29,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:29,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861844320] [2019-12-07 18:58:29,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:29,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:29,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:29,003 INFO L87 Difference]: Start difference. First operand 8229 states and 8692 transitions. Second operand 4 states. [2019-12-07 18:58:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:30,044 INFO L93 Difference]: Finished difference Result 17772 states and 18743 transitions. [2019-12-07 18:58:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:30,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 874 [2019-12-07 18:58:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:30,061 INFO L225 Difference]: With dead ends: 17772 [2019-12-07 18:58:30,061 INFO L226 Difference]: Without dead ends: 9216 [2019-12-07 18:58:30,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-12-07 18:58:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 7900. [2019-12-07 18:58:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-12-07 18:58:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8219 transitions. [2019-12-07 18:58:30,130 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8219 transitions. Word has length 874 [2019-12-07 18:58:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:30,131 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 8219 transitions. [2019-12-07 18:58:30,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8219 transitions. [2019-12-07 18:58:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2019-12-07 18:58:30,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:30,144 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:30,144 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2118622610, now seen corresponding path program 1 times [2019-12-07 18:58:30,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:30,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044714911] [2019-12-07 18:58:30,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 1122 proven. 38 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-12-07 18:58:32,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044714911] [2019-12-07 18:58:32,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779072228] [2019-12-07 18:58:32,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:32,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:58:32,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:58:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 964 proven. 83 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-12-07 18:58:33,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:58:33,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-12-07 18:58:33,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933763713] [2019-12-07 18:58:33,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:58:33,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:33,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:58:33,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:58:33,401 INFO L87 Difference]: Start difference. First operand 7900 states and 8219 transitions. Second operand 11 states. [2019-12-07 18:58:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:43,730 INFO L93 Difference]: Finished difference Result 19469 states and 20307 transitions. [2019-12-07 18:58:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:58:43,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1029 [2019-12-07 18:58:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:43,758 INFO L225 Difference]: With dead ends: 19469 [2019-12-07 18:58:43,759 INFO L226 Difference]: Without dead ends: 11900 [2019-12-07 18:58:43,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 1044 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:58:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-07 18:58:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 9740. [2019-12-07 18:58:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9740 states. [2019-12-07 18:58:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 10058 transitions. [2019-12-07 18:58:43,841 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 10058 transitions. Word has length 1029 [2019-12-07 18:58:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:43,841 INFO L462 AbstractCegarLoop]: Abstraction has 9740 states and 10058 transitions. [2019-12-07 18:58:43,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:58:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 10058 transitions. [2019-12-07 18:58:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1660 [2019-12-07 18:58:43,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:43,861 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:44,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:44,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1015306804, now seen corresponding path program 1 times [2019-12-07 18:58:44,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:44,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261121999] [2019-12-07 18:58:44,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 1977 proven. 157 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2019-12-07 18:58:46,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261121999] [2019-12-07 18:58:46,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736282562] [2019-12-07 18:58:46,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:47,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 1890 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:58:47,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:58:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4527 backedges. 2134 proven. 0 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2019-12-07 18:58:48,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:58:48,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 18:58:48,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207224082] [2019-12-07 18:58:48,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:48,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:48,906 INFO L87 Difference]: Start difference. First operand 9740 states and 10058 transitions. Second operand 3 states. [2019-12-07 18:58:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:49,672 INFO L93 Difference]: Finished difference Result 20743 states and 21415 transitions. [2019-12-07 18:58:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:49,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1659 [2019-12-07 18:58:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:49,682 INFO L225 Difference]: With dead ends: 20743 [2019-12-07 18:58:49,682 INFO L226 Difference]: Without dead ends: 11334 [2019-12-07 18:58:49,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1667 GetRequests, 1658 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11334 states. [2019-12-07 18:58:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11334 to 10883. [2019-12-07 18:58:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-12-07 18:58:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11216 transitions. [2019-12-07 18:58:49,765 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11216 transitions. Word has length 1659 [2019-12-07 18:58:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:49,766 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11216 transitions. [2019-12-07 18:58:49,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11216 transitions. [2019-12-07 18:58:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1829 [2019-12-07 18:58:49,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:49,788 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:49,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:49,989 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash 231526824, now seen corresponding path program 1 times [2019-12-07 18:58:49,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:49,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743683181] [2019-12-07 18:58:49,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 4447 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2019-12-07 18:58:54,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743683181] [2019-12-07 18:58:54,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:54,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:58:54,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341637860] [2019-12-07 18:58:54,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:58:54,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:58:54,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:54,205 INFO L87 Difference]: Start difference. First operand 10883 states and 11216 transitions. Second operand 9 states. [2019-12-07 18:58:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:58,703 INFO L93 Difference]: Finished difference Result 29687 states and 30616 transitions. [2019-12-07 18:58:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:58:58,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1828 [2019-12-07 18:58:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:58,716 INFO L225 Difference]: With dead ends: 29687 [2019-12-07 18:58:58,716 INFO L226 Difference]: Without dead ends: 19135 [2019-12-07 18:58:58,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:58:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19135 states. [2019-12-07 18:58:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19135 to 10883. [2019-12-07 18:58:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-12-07 18:58:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11202 transitions. [2019-12-07 18:58:58,817 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11202 transitions. Word has length 1828 [2019-12-07 18:58:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:58,818 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11202 transitions. [2019-12-07 18:58:58,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:58:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11202 transitions. [2019-12-07 18:58:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1833 [2019-12-07 18:58:58,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:58,841 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 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, 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-12-07 18:58:58,841 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1515186063, now seen corresponding path program 1 times [2019-12-07 18:58:58,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:58,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234924812] [2019-12-07 18:58:58,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6644 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 6285 trivial. 0 not checked. [2019-12-07 18:59:00,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234924812] [2019-12-07 18:59:00,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:00,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:59:00,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430474522] [2019-12-07 18:59:00,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:59:00,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:59:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:59:00,662 INFO L87 Difference]: Start difference. First operand 10883 states and 11202 transitions. Second operand 4 states. [2019-12-07 18:59:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:01,683 INFO L93 Difference]: Finished difference Result 22093 states and 22731 transitions. [2019-12-07 18:59:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:59:01,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1832 [2019-12-07 18:59:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:01,693 INFO L225 Difference]: With dead ends: 22093 [2019-12-07 18:59:01,693 INFO L226 Difference]: Without dead ends: 10883 [2019-12-07 18:59:01,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:59:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-07 18:59:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 10883. [2019-12-07 18:59:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2019-12-07 18:59:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 11131 transitions. [2019-12-07 18:59:01,767 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 11131 transitions. Word has length 1832 [2019-12-07 18:59:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:01,768 INFO L462 AbstractCegarLoop]: Abstraction has 10883 states and 11131 transitions. [2019-12-07 18:59:01,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:59:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 11131 transitions. [2019-12-07 18:59:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1990 [2019-12-07 18:59:01,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:01,809 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-12-07 18:59:01,810 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:01,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1621777748, now seen corresponding path program 1 times [2019-12-07 18:59:01,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:01,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403966807] [2019-12-07 18:59:01,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 4615 proven. 186 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-12-07 18:59:04,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403966807] [2019-12-07 18:59:04,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585839252] [2019-12-07 18:59:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:05,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 2268 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:59:05,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 4646 proven. 0 refuted. 0 times theorem prover too weak. 2317 trivial. 0 not checked. [2019-12-07 18:59:08,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:08,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 18:59:08,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897117906] [2019-12-07 18:59:08,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:59:08,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:59:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:59:08,004 INFO L87 Difference]: Start difference. First operand 10883 states and 11131 transitions. Second operand 4 states. [2019-12-07 18:59:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:08,917 INFO L93 Difference]: Finished difference Result 21438 states and 21932 transitions. [2019-12-07 18:59:08,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:59:08,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1989 [2019-12-07 18:59:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:08,924 INFO L225 Difference]: With dead ends: 21438 [2019-12-07 18:59:08,924 INFO L226 Difference]: Without dead ends: 10886 [2019-12-07 18:59:08,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1991 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:59:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-12-07 18:59:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 10203. [2019-12-07 18:59:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10203 states. [2019-12-07 18:59:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10425 transitions. [2019-12-07 18:59:08,992 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10425 transitions. Word has length 1989 [2019-12-07 18:59:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:08,993 INFO L462 AbstractCegarLoop]: Abstraction has 10203 states and 10425 transitions. [2019-12-07 18:59:08,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:59:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10425 transitions. [2019-12-07 18:59:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2076 [2019-12-07 18:59:09,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:09,019 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, 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, 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, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:59:09,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:09,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1522743548, now seen corresponding path program 1 times [2019-12-07 18:59:09,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:09,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727861676] [2019-12-07 18:59:09,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7671 backedges. 2975 proven. 1949 refuted. 0 times theorem prover too weak. 2747 trivial. 0 not checked. [2019-12-07 18:59:17,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727861676] [2019-12-07 18:59:17,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665511496] [2019-12-07 18:59:17,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:17,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:59:17,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7671 backedges. 4321 proven. 0 refuted. 0 times theorem prover too weak. 3350 trivial. 0 not checked. [2019-12-07 18:59:19,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:19,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 16 [2019-12-07 18:59:19,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051956679] [2019-12-07 18:59:19,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:19,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:19,373 INFO L87 Difference]: Start difference. First operand 10203 states and 10425 transitions. Second operand 3 states. [2019-12-07 18:59:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:20,104 INFO L93 Difference]: Finished difference Result 20733 states and 21186 transitions. [2019-12-07 18:59:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:20,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2075 [2019-12-07 18:59:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:20,111 INFO L225 Difference]: With dead ends: 20733 [2019-12-07 18:59:20,111 INFO L226 Difference]: Without dead ends: 10861 [2019-12-07 18:59:20,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2098 GetRequests, 2076 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-12-07 18:59:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2019-12-07 18:59:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-12-07 18:59:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11087 transitions. [2019-12-07 18:59:20,181 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11087 transitions. Word has length 2075 [2019-12-07 18:59:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:20,182 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11087 transitions. [2019-12-07 18:59:20,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11087 transitions. [2019-12-07 18:59:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2160 [2019-12-07 18:59:20,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:20,207 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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, 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] [2019-12-07 18:59:20,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:20,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash 958669163, now seen corresponding path program 1 times [2019-12-07 18:59:20,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:20,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515311992] [2019-12-07 18:59:20,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8787 backedges. 3342 proven. 2973 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2019-12-07 18:59:30,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515311992] [2019-12-07 18:59:30,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86201946] [2019-12-07 18:59:30,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:30,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 2487 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:59:30,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:30,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:30,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8787 backedges. 4964 proven. 0 refuted. 0 times theorem prover too weak. 3823 trivial. 0 not checked. [2019-12-07 18:59:33,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:33,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2019-12-07 18:59:33,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127198096] [2019-12-07 18:59:33,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:33,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:59:33,806 INFO L87 Difference]: Start difference. First operand 10861 states and 11087 transitions. Second operand 3 states. [2019-12-07 18:59:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:34,807 INFO L93 Difference]: Finished difference Result 23694 states and 24208 transitions. [2019-12-07 18:59:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:34,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2159 [2019-12-07 18:59:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:34,815 INFO L225 Difference]: With dead ends: 23694 [2019-12-07 18:59:34,815 INFO L226 Difference]: Without dead ends: 13164 [2019-12-07 18:59:34,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2181 GetRequests, 2159 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:59:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-07 18:59:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2019-12-07 18:59:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-12-07 18:59:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13095 transitions. [2019-12-07 18:59:34,902 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13095 transitions. Word has length 2159 [2019-12-07 18:59:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:34,903 INFO L462 AbstractCegarLoop]: Abstraction has 12835 states and 13095 transitions. [2019-12-07 18:59:34,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13095 transitions. [2019-12-07 18:59:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2212 [2019-12-07 18:59:34,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:34,930 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:35,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:35,131 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1613825995, now seen corresponding path program 1 times [2019-12-07 18:59:35,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:35,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231647918] [2019-12-07 18:59:35,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9605 backedges. 5637 proven. 0 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2019-12-07 18:59:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231647918] [2019-12-07 18:59:37,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:37,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:59:37,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129117980] [2019-12-07 18:59:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:59:37,535 INFO L87 Difference]: Start difference. First operand 12835 states and 13095 transitions. Second operand 3 states. [2019-12-07 18:59:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:38,291 INFO L93 Difference]: Finished difference Result 30274 states and 30904 transitions. [2019-12-07 18:59:38,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:38,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2211 [2019-12-07 18:59:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:38,304 INFO L225 Difference]: With dead ends: 30274 [2019-12-07 18:59:38,304 INFO L226 Difference]: Without dead ends: 17770 [2019-12-07 18:59:38,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:59:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-12-07 18:59:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 15796. [2019-12-07 18:59:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15796 states. [2019-12-07 18:59:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16116 transitions. [2019-12-07 18:59:38,421 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16116 transitions. Word has length 2211 [2019-12-07 18:59:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:38,422 INFO L462 AbstractCegarLoop]: Abstraction has 15796 states and 16116 transitions. [2019-12-07 18:59:38,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16116 transitions. [2019-12-07 18:59:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2019-12-07 18:59:38,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:38,454 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-12-07 18:59:38,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:38,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:38,455 INFO L82 PathProgramCache]: Analyzing trace with hash -834045833, now seen corresponding path program 1 times [2019-12-07 18:59:38,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:38,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402361523] [2019-12-07 18:59:38,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 3555 proven. 3159 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-12-07 18:59:48,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402361523] [2019-12-07 18:59:48,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631261669] [2019-12-07 18:59:48,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:49,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 2580 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:49,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:49,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 9024 trivial. 0 not checked. [2019-12-07 18:59:51,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:51,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2019-12-07 18:59:51,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402589611] [2019-12-07 18:59:51,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:51,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:59:51,441 INFO L87 Difference]: Start difference. First operand 15796 states and 16116 transitions. Second operand 3 states. [2019-12-07 18:59:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:53,407 INFO L93 Difference]: Finished difference Result 32904 states and 33599 transitions. [2019-12-07 18:59:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:53,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2252 [2019-12-07 18:59:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:53,408 INFO L225 Difference]: With dead ends: 32904 [2019-12-07 18:59:53,408 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:59:53,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2274 GetRequests, 2252 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:59:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:59:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:59:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:59:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:59:53,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2252 [2019-12-07 18:59:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:53,417 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:59:53,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:59:53,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:59:53,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:53,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:59:53,829 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 186 [2019-12-07 18:59:54,032 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 186 [2019-12-07 18:59:54,784 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 90 [2019-12-07 18:59:55,316 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89 [2019-12-07 18:59:56,044 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 90 [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,047 INFO L246 CegarLoopResult]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L242 CegarLoopResult]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse5 (= ~a16~0 9)) (.cse1 (= ~a15~0 3)) (.cse10 (<= (+ ~a18~0 79) 0)) (.cse2 (< 0 (+ ~a18~0 156))) (.cse7 (= ~a12~0 8)) (.cse13 (= ~a12~0 5))) (let ((.cse3 (not .cse13)) (.cse9 (not .cse7)) (.cse6 (= ~a16~0 8)) (.cse8 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse4 (= ~a15~0 4)) (.cse0 (or (not .cse5) (and .cse1 .cse10 .cse2))) (.cse11 (not (= ~a16~0 12)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5 (= ~a12~0 7)) (and .cse6 .cse1) (and .cse4 (or (not (= 1 ULTIMATE.start_calculate_output2_~input)) .cse2) .cse5 .cse7 (or .cse8 .cse2)) (and .cse4 .cse5 .cse3 .cse9 .cse10) (and .cse4 .cse11 (<= ~a12~0 6) .cse8 (<= (+ ~a18~0 391209) 0)) (and .cse4 (not (= ~a12~0 9)) .cse0 .cse11 .cse9 .cse10) (and .cse1 (exists ((v_~a18~0_903 Int)) (let ((.cse12 (mod v_~a18~0_903 299932))) (and (not (= .cse12 0)) (< v_~a18~0_903 0) (<= (+ .cse12 134) ~a18~0))))) (and .cse6 .cse4) (and .cse4 .cse11 .cse13 .cse8 .cse10 .cse2) (and .cse4 .cse11 (= ~a12~0 6)) (and .cse4 .cse0 .cse11 (exists ((v_~a18~0_901 Int)) (let ((.cse15 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse14 (* 5 .cse15))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse14) (<= (div (* .cse15 5) 5) ~a18~0) (<= 0 .cse14))))) .cse13)))) [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,048 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,049 INFO L246 CegarLoopResult]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:59:56,050 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L242 CegarLoopResult]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse5 (= ~a12~0 5)) (.cse16 (= ~a12~0 8)) (.cse6 (= ~a16~0 9))) (let ((.cse1 (not .cse6)) (.cse8 (<= (+ ~a18~0 79) 0)) (.cse9 (not .cse16)) (.cse13 (<= ~a12~0 6)) (.cse14 (not (= 1 ULTIMATE.start_calculate_output2_~input))) (.cse15 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse12 (< 0 (+ ~a18~0 156))) (.cse11 (= ~a16~0 8)) (.cse7 (not .cse5)) (.cse10 (= ~a15~0 3)) (.cse0 (= ~a15~0 4)) (.cse2 (not (= ~a16~0 12)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~a18~0_901 Int)) (let ((.cse4 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse3 (* 5 .cse4))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse3) (<= (div (* .cse4 5) 5) ~a18~0) (<= 0 .cse3))))) .cse5) (and .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse7 .cse10) (and .cse0 .cse6 (= ~a12~0 7)) (and .cse11 .cse0 (not (= 3 ULTIMATE.start_calculate_output_~input))) (and .cse1 .cse10 .cse12) (and .cse11 .cse10) (and .cse0 .cse2 .cse13 .cse14 .cse15 .cse8 .cse12) (and .cse0 (not (= ~a12~0 9)) .cse1 .cse2 .cse8 .cse9) (and .cse0 .cse2 .cse13 .cse14 .cse15 (<= (+ ~a18~0 391209) 0)) (and .cse0 .cse6 .cse14 .cse16 (or .cse15 .cse12)) (and .cse11 .cse0 .cse7) (and .cse10 (exists ((v_~a18~0_903 Int)) (let ((.cse17 (mod v_~a18~0_903 299932))) (and (not (= .cse17 0)) (< v_~a18~0_903 0) (<= (+ .cse17 134) ~a18~0))))) (and .cse0 .cse2 (= ~a12~0 6))))) [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,051 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L249 CegarLoopResult]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,052 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,053 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L242 CegarLoopResult]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse5 (= ~a16~0 9)) (.cse1 (= ~a15~0 3)) (.cse10 (<= (+ ~a18~0 79) 0)) (.cse2 (< 0 (+ ~a18~0 156))) (.cse7 (= ~a12~0 8)) (.cse13 (= ~a12~0 5))) (let ((.cse3 (not .cse13)) (.cse9 (not .cse7)) (.cse6 (= ~a16~0 8)) (.cse8 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse4 (= ~a15~0 4)) (.cse0 (or (not .cse5) (and .cse1 .cse10 .cse2))) (.cse11 (not (= ~a16~0 12)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5 (= ~a12~0 7)) (and .cse6 .cse1) (and .cse4 (or (not (= 1 ULTIMATE.start_calculate_output2_~input)) .cse2) .cse5 .cse7 (or .cse8 .cse2)) (and .cse4 .cse5 .cse3 .cse9 .cse10) (and .cse4 .cse11 (<= ~a12~0 6) .cse8 (<= (+ ~a18~0 391209) 0)) (and .cse4 (not (= ~a12~0 9)) .cse0 .cse11 .cse9 .cse10) (and .cse1 (exists ((v_~a18~0_903 Int)) (let ((.cse12 (mod v_~a18~0_903 299932))) (and (not (= .cse12 0)) (< v_~a18~0_903 0) (<= (+ .cse12 134) ~a18~0))))) (and .cse6 .cse4) (and .cse4 .cse11 .cse13 .cse8 .cse10 .cse2) (and .cse4 .cse11 (= ~a12~0 6)) (and .cse4 .cse0 .cse11 (exists ((v_~a18~0_901 Int)) (let ((.cse15 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse14 (* 5 .cse15))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse14) (<= (div (* .cse15 5) 5) ~a18~0) (<= 0 .cse14))))) .cse13)))) [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,054 INFO L246 CegarLoopResult]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,055 INFO L246 CegarLoopResult]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,056 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,057 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:59:56,058 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,059 INFO L246 CegarLoopResult]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,060 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,061 INFO L246 CegarLoopResult]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,062 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,063 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,064 INFO L246 CegarLoopResult]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,065 INFO L246 CegarLoopResult]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,066 INFO L246 CegarLoopResult]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,067 INFO L246 CegarLoopResult]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-12-07 18:59:56,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:59:56 BoogieIcfgContainer [2019-12-07 18:59:56,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:59:56,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:59:56,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:59:56,097 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:59:56,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:13" (3/4) ... [2019-12-07 18:59:56,099 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:59:56,122 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 18:59:56,124 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:59:56,144 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156)) && a15 == 3) && 0 < a18 + 156) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (a16 == 8 && a15 == 3)) || ((((a15 == 4 && (!(1 == input) || 0 < a18 + 156)) && a16 == 9) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && a18 + 391209 <= 0)) || (((((a15 == 4 && !(a12 == 9)) && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || (a16 == 8 && a15 == 4)) || (((((a15 == 4 && !(a16 == 12)) && a12 == 5) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((a15 == 4 && !(a16 == 12)) && a12 == 6)) || ((((a15 == 4 && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) [2019-12-07 18:59:56,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156)) && a15 == 3) && 0 < a18 + 156) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (a16 == 8 && a15 == 3)) || ((((a15 == 4 && (!(1 == input) || 0 < a18 + 156)) && a16 == 9) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && a18 + 391209 <= 0)) || (((((a15 == 4 && !(a12 == 9)) && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || (a16 == 8 && a15 == 4)) || (((((a15 == 4 && !(a16 == 12)) && a12 == 5) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((a15 == 4 && !(a16 == 12)) && a12 == 6)) || ((((a15 == 4 && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) [2019-12-07 18:59:56,153 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((a15 == 4 && !(a16 == 9)) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && a18 + 79 <= 0) && !(a12 == 8))) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || ((a16 == 8 && a15 == 4) && !(3 == input))) || ((!(a16 == 9) && a15 == 3) && 0 < a18 + 156)) || (a16 == 8 && a15 == 3)) || ((((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || (((((a15 == 4 && !(a12 == 9)) && !(a16 == 9)) && !(a16 == 12)) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && !(1 == input)) && a18 + 391209 <= 0)) || ((((a15 == 4 && a16 == 9) && !(1 == input)) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((a16 == 8 && a15 == 4) && !(a12 == 5))) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && !(a16 == 12)) && a12 == 6) [2019-12-07 18:59:56,248 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e2f6e2f1-c553-4527-b25e-420630eefe7f/bin/uautomizer/witness.graphml [2019-12-07 18:59:56,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:59:56,249 INFO L168 Benchmark]: Toolchain (without parser) took 105362.12 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 940.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,249 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:56,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -110.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,250 INFO L168 Benchmark]: Boogie Preprocessor took 82.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,250 INFO L168 Benchmark]: RCFGBuilder took 1448.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 187.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,250 INFO L168 Benchmark]: TraceAbstraction took 102977.12 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 989.8 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,251 INFO L168 Benchmark]: Witness Printer took 151.97 ms. Allocated memory is still 4.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:56,252 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -110.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1448.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 187.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 102977.12 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 989.8 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 151.97 ms. Allocated memory is still 4.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 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_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 18:59:56,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((((!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156)) && a15 == 3) && 0 < a18 + 156) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (a16 == 8 && a15 == 3)) || ((((a15 == 4 && (!(1 == input) || 0 < a18 + 156)) && a16 == 9) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && a18 + 391209 <= 0)) || (((((a15 == 4 && !(a12 == 9)) && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || (a16 == 8 && a15 == 4)) || (((((a15 == 4 && !(a16 == 12)) && a12 == 5) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((a15 == 4 && !(a16 == 12)) && a12 == 6)) || ((((a15 == 4 && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) - InvariantResult [Line: 1494]: Loop Invariant [2019-12-07 18:59:56,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((((((a15 == 4 && !(a16 == 9)) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && a18 + 79 <= 0) && !(a12 == 8))) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || ((a16 == 8 && a15 == 4) && !(3 == input))) || ((!(a16 == 9) && a15 == 3) && 0 < a18 + 156)) || (a16 == 8 && a15 == 3)) || ((((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || (((((a15 == 4 && !(a12 == 9)) && !(a16 == 9)) && !(a16 == 12)) && a18 + 79 <= 0) && !(a12 == 8))) || (((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && !(1 == input)) && a18 + 391209 <= 0)) || ((((a15 == 4 && a16 == 9) && !(1 == input)) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((a16 == 8 && a15 == 4) && !(a12 == 5))) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || ((a15 == 4 && !(a16 == 12)) && a12 == 6) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-12-07 18:59:56,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-12-07 18:59:56,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-12-07 18:59:56,263 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((((!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156)) && a15 == 3) && 0 < a18 + 156) || (!(a12 == 5) && a15 == 3)) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (a16 == 8 && a15 == 3)) || ((((a15 == 4 && (!(1 == input) || 0 < a18 + 156)) && a16 == 9) && a12 == 8) && (!(1 == input) || 0 < a18 + 156))) || ((((a15 == 4 && a16 == 9) && !(a12 == 5)) && !(a12 == 8)) && a18 + 79 <= 0)) || ((((a15 == 4 && !(a16 == 12)) && a12 <= 6) && !(1 == input)) && a18 + 391209 <= 0)) || (((((a15 == 4 && !(a12 == 9)) && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (a15 == 3 && (\exists v_~a18~0_903 : int :: (!(v_~a18~0_903 % 299932 == 0) && v_~a18~0_903 < 0) && v_~a18~0_903 % 299932 + 134 <= a18))) || (a16 == 8 && a15 == 4)) || (((((a15 == 4 && !(a16 == 12)) && a12 == 5) && !(1 == input)) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((a15 == 4 && !(a16 == 12)) && a12 == 6)) || ((((a15 == 4 && (!(a16 == 9) || ((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156))) && !(a16 == 12)) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && a12 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 100.4s, OverallIterations: 16, TraceHistogramMax: 14, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 3705 SDtfs, 11466 SDslu, 329 SDs, 0 SdLazy, 36795 SolverSat, 3497 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 27.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12077 GetRequests, 11907 SyntacticMatches, 29 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15796occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 16503 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 183 NumberOfFragments, 858 HoareAnnotationTreeSize, 4 FomulaSimplifications, 23821 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 8391 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 32375 NumberOfCodeBlocks, 32375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 32352 ConstructedInterpolants, 148 QuantifiedInterpolants, 219996721 SizeOfPredicates, 5 NumberOfNonLiveVariables, 13653 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 96673/105461 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...