./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/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 30c34688967b08e009ee7c945b5c905ca7f15dd9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:03:37,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:03:37,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:03:37,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:03:37,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:03:37,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:03:37,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:03:37,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:03:37,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:03:37,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:03:37,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:03:37,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:03:37,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:03:37,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:03:37,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:03:37,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:03:37,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:03:37,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:03:37,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:03:37,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:03:37,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:03:37,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:03:37,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:03:37,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:03:37,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:03:37,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:03:37,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:03:37,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:03:37,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:03:37,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:03:37,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:03:37,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:03:37,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:03:37,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:03:37,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:03:37,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:03:37,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:03:37,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:03:37,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:03:37,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:03:37,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:03:37,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:03:37,394 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:03:37,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:03:37,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:03:37,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:03:37,406 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:03:37,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:03:37,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:03:37,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:03:37,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:03:37,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:03:37,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:03:37,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:03:37,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:03:37,408 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:03:37,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:03:37,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:03:37,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:03:37,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:03:37,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:03:37,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:03:37,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:03:37,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:03:37,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:03:37,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:03:37,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:03:37,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:03:37,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:03:37,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:03:37,412 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_437c63b7-14fa-4874-90a1-ad3a110c2082/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 -> 30c34688967b08e009ee7c945b5c905ca7f15dd9 [2019-11-20 08:03:37,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:03:37,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:03:37,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:03:37,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:03:37,581 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:03:37,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-11-20 08:03:37,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/data/1d2848171/15826780ef314db0a0f91e11579bdb93/FLAG4c0c6df45 [2019-11-20 08:03:38,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:03:38,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-11-20 08:03:38,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/data/1d2848171/15826780ef314db0a0f91e11579bdb93/FLAG4c0c6df45 [2019-11-20 08:03:38,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/data/1d2848171/15826780ef314db0a0f91e11579bdb93 [2019-11-20 08:03:38,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:03:38,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:03:38,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:03:38,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:03:38,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:03:38,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:03:38" (1/1) ... [2019-11-20 08:03:38,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c38c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:38, skipping insertion in model container [2019-11-20 08:03:38,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:03:38" (1/1) ... [2019-11-20 08:03:38,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:03:38,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:03:39,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:03:39,436 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:03:39,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:03:39,727 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:03:39,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39 WrapperNode [2019-11-20 08:03:39,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:03:39,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:03:39,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:03:39,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:03:39,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:39,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:39,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:03:39,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:03:39,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:03:39,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:03:39,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:39,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:39,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:39,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:40,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:40,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:40,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... [2019-11-20 08:03:40,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:03:40,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:03:40,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:03:40,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:03:40,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:03:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:03:40,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:03:44,078 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:03:44,079 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 08:03:44,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:44 BoogieIcfgContainer [2019-11-20 08:03:44,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:03:44,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:03:44,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:03:44,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:03:44,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:03:38" (1/3) ... [2019-11-20 08:03:44,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328872b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:03:44, skipping insertion in model container [2019-11-20 08:03:44,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:39" (2/3) ... [2019-11-20 08:03:44,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328872b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:03:44, skipping insertion in model container [2019-11-20 08:03:44,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:44" (3/3) ... [2019-11-20 08:03:44,092 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label59.c [2019-11-20 08:03:44,102 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:03:44,110 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:03:44,122 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:03:44,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:03:44,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:03:44,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:03:44,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:03:44,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:03:44,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:03:44,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:03:44,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:03:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 08:03:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-20 08:03:44,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:03:44,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:03:44,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:03:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:03:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-11-20 08:03:44,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:03:44,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108749735] [2019-11-20 08:03:44,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:03:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:03:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:03:44,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108749735] [2019-11-20 08:03:44,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:03:44,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:03:44,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202581134] [2019-11-20 08:03:44,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:03:44,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:03:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:03:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:03:44,537 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 08:03:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:03:49,330 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-20 08:03:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:03:49,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-20 08:03:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:03:49,368 INFO L225 Difference]: With dead ends: 1514 [2019-11-20 08:03:49,369 INFO L226 Difference]: Without dead ends: 1008 [2019-11-20 08:03:49,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:03:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-20 08:03:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-20 08:03:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-20 08:03:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-20 08:03:49,485 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 54 [2019-11-20 08:03:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:03:49,486 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-20 08:03:49,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:03:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-20 08:03:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 08:03:49,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:03:49,496 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:03:49,496 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:03:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:03:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1246806213, now seen corresponding path program 1 times [2019-11-20 08:03:49,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:03:49,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173658721] [2019-11-20 08:03:49,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:03:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:03:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:03:49,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173658721] [2019-11-20 08:03:49,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:03:49,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:03:49,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017121305] [2019-11-20 08:03:49,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:03:49,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:03:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:03:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:03:49,749 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-11-20 08:03:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:03:54,652 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-11-20 08:03:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:03:54,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-11-20 08:03:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:03:54,664 INFO L225 Difference]: With dead ends: 2303 [2019-11-20 08:03:54,664 INFO L226 Difference]: Without dead ends: 1628 [2019-11-20 08:03:54,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:03:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-11-20 08:03:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-11-20 08:03:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-20 08:03:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-11-20 08:03:54,694 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 119 [2019-11-20 08:03:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:03:54,696 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-11-20 08:03:54,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:03:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-11-20 08:03:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 08:03:54,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:03:54,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:03:54,702 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:03:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:03:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash -214871010, now seen corresponding path program 1 times [2019-11-20 08:03:54,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:03:54,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649735225] [2019-11-20 08:03:54,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:03:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:03:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:03:54,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649735225] [2019-11-20 08:03:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:03:54,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:03:54,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501826055] [2019-11-20 08:03:54,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:03:54,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:03:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:03:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:03:54,872 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-11-20 08:03:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:03:57,781 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-11-20 08:03:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:03:57,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 08:03:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:03:57,802 INFO L225 Difference]: With dead ends: 3777 [2019-11-20 08:03:57,802 INFO L226 Difference]: Without dead ends: 2790 [2019-11-20 08:03:57,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:03:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-11-20 08:03:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-11-20 08:03:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-20 08:03:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-11-20 08:03:57,865 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 120 [2019-11-20 08:03:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:03:57,866 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-11-20 08:03:57,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:03:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-11-20 08:03:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 08:03:57,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:03:57,868 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:03:57,869 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:03:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:03:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1115564308, now seen corresponding path program 1 times [2019-11-20 08:03:57,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:03:57,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803329803] [2019-11-20 08:03:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:03:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:03:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:03:57,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803329803] [2019-11-20 08:03:57,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:03:57,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:03:57,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589637112] [2019-11-20 08:03:57,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:03:57,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:03:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:03:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:03:57,981 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-11-20 08:04:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:01,266 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-11-20 08:04:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:04:01,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-20 08:04:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:01,299 INFO L225 Difference]: With dead ends: 7368 [2019-11-20 08:04:01,299 INFO L226 Difference]: Without dead ends: 5484 [2019-11-20 08:04:01,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:04:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-11-20 08:04:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-11-20 08:04:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-11-20 08:04:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-11-20 08:04:01,412 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 124 [2019-11-20 08:04:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:01,413 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-11-20 08:04:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:04:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-11-20 08:04:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 08:04:01,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:01,415 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 08:04:01,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1684612182, now seen corresponding path program 1 times [2019-11-20 08:04:01,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:01,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720905181] [2019-11-20 08:04:01,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:01,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720905181] [2019-11-20 08:04:01,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:04:01,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807001561] [2019-11-20 08:04:01,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:04:01,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:01,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:04:01,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:04:01,535 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 4 states. [2019-11-20 08:04:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:04,374 INFO L93 Difference]: Finished difference Result 17833 states and 23134 transitions. [2019-11-20 08:04:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:04:04,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-20 08:04:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:04,409 INFO L225 Difference]: With dead ends: 17833 [2019-11-20 08:04:04,410 INFO L226 Difference]: Without dead ends: 8469 [2019-11-20 08:04:04,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:04:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2019-11-20 08:04:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 8469. [2019-11-20 08:04:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8469 states. [2019-11-20 08:04:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 9448 transitions. [2019-11-20 08:04:04,767 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 9448 transitions. Word has length 145 [2019-11-20 08:04:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:04,767 INFO L462 AbstractCegarLoop]: Abstraction has 8469 states and 9448 transitions. [2019-11-20 08:04:04,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:04:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 9448 transitions. [2019-11-20 08:04:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-11-20 08:04:04,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:04,776 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:04,780 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1210416382, now seen corresponding path program 1 times [2019-11-20 08:04:04,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:04,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091411958] [2019-11-20 08:04:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:05,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091411958] [2019-11-20 08:04:05,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:05,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:04:05,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372089694] [2019-11-20 08:04:05,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:04:05,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:04:05,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:04:05,288 INFO L87 Difference]: Start difference. First operand 8469 states and 9448 transitions. Second operand 5 states. [2019-11-20 08:04:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:07,831 INFO L93 Difference]: Finished difference Result 20244 states and 22382 transitions. [2019-11-20 08:04:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:04:07,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2019-11-20 08:04:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:07,882 INFO L225 Difference]: With dead ends: 20244 [2019-11-20 08:04:07,883 INFO L226 Difference]: Without dead ends: 11179 [2019-11-20 08:04:07,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:04:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2019-11-20 08:04:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 9667. [2019-11-20 08:04:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9667 states. [2019-11-20 08:04:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9667 states to 9667 states and 10707 transitions. [2019-11-20 08:04:08,103 INFO L78 Accepts]: Start accepts. Automaton has 9667 states and 10707 transitions. Word has length 287 [2019-11-20 08:04:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:08,104 INFO L462 AbstractCegarLoop]: Abstraction has 9667 states and 10707 transitions. [2019-11-20 08:04:08,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:04:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9667 states and 10707 transitions. [2019-11-20 08:04:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-20 08:04:08,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:08,111 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:08,112 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1076396748, now seen corresponding path program 1 times [2019-11-20 08:04:08,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:08,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789892140] [2019-11-20 08:04:08,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:09,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789892140] [2019-11-20 08:04:09,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621829140] [2019-11-20 08:04:09,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:09,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:04:09,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:04:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:04:09,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 08:04:09,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087739981] [2019-11-20 08:04:09,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:04:09,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:04:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:09,542 INFO L87 Difference]: Start difference. First operand 9667 states and 10707 transitions. Second operand 3 states. [2019-11-20 08:04:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:10,852 INFO L93 Difference]: Finished difference Result 19034 states and 21112 transitions. [2019-11-20 08:04:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:04:10,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-11-20 08:04:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:10,870 INFO L225 Difference]: With dead ends: 19034 [2019-11-20 08:04:10,870 INFO L226 Difference]: Without dead ends: 9668 [2019-11-20 08:04:10,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9668 states. [2019-11-20 08:04:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9668 to 9665. [2019-11-20 08:04:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9665 states. [2019-11-20 08:04:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 10555 transitions. [2019-11-20 08:04:11,023 INFO L78 Accepts]: Start accepts. Automaton has 9665 states and 10555 transitions. Word has length 324 [2019-11-20 08:04:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:11,025 INFO L462 AbstractCegarLoop]: Abstraction has 9665 states and 10555 transitions. [2019-11-20 08:04:11,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:04:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9665 states and 10555 transitions. [2019-11-20 08:04:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-20 08:04:11,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:11,040 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:11,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:11,245 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -864696258, now seen corresponding path program 1 times [2019-11-20 08:04:11,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:11,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668892418] [2019-11-20 08:04:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-11-20 08:04:12,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668892418] [2019-11-20 08:04:12,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:12,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:04:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653309480] [2019-11-20 08:04:12,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:04:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:04:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:04:12,168 INFO L87 Difference]: Start difference. First operand 9665 states and 10555 transitions. Second operand 5 states. [2019-11-20 08:04:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:14,698 INFO L93 Difference]: Finished difference Result 19629 states and 21436 transitions. [2019-11-20 08:04:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:04:14,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 505 [2019-11-20 08:04:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:14,715 INFO L225 Difference]: With dead ends: 19629 [2019-11-20 08:04:14,715 INFO L226 Difference]: Without dead ends: 10265 [2019-11-20 08:04:14,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:04:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2019-11-20 08:04:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10263. [2019-11-20 08:04:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-11-20 08:04:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 11158 transitions. [2019-11-20 08:04:14,880 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 11158 transitions. Word has length 505 [2019-11-20 08:04:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:14,881 INFO L462 AbstractCegarLoop]: Abstraction has 10263 states and 11158 transitions. [2019-11-20 08:04:14,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:04:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 11158 transitions. [2019-11-20 08:04:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-11-20 08:04:14,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:14,910 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:14,911 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 535763756, now seen corresponding path program 1 times [2019-11-20 08:04:14,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:14,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685021050] [2019-11-20 08:04:14,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 435 proven. 70 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-20 08:04:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685021050] [2019-11-20 08:04:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383636806] [2019-11-20 08:04:16,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:16,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:04:16,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-20 08:04:16,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:04:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 08:04:16,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679646748] [2019-11-20 08:04:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:04:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:04:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:16,939 INFO L87 Difference]: Start difference. First operand 10263 states and 11158 transitions. Second operand 3 states. [2019-11-20 08:04:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:18,441 INFO L93 Difference]: Finished difference Result 23217 states and 25265 transitions. [2019-11-20 08:04:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:04:18,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 579 [2019-11-20 08:04:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:18,468 INFO L225 Difference]: With dead ends: 23217 [2019-11-20 08:04:18,468 INFO L226 Difference]: Without dead ends: 13255 [2019-11-20 08:04:18,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 579 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-11-20 08:04:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 13252. [2019-11-20 08:04:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13252 states. [2019-11-20 08:04:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13252 states to 13252 states and 14238 transitions. [2019-11-20 08:04:18,653 INFO L78 Accepts]: Start accepts. Automaton has 13252 states and 14238 transitions. Word has length 579 [2019-11-20 08:04:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:18,654 INFO L462 AbstractCegarLoop]: Abstraction has 13252 states and 14238 transitions. [2019-11-20 08:04:18,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:04:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13252 states and 14238 transitions. [2019-11-20 08:04:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-11-20 08:04:18,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:18,677 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:18,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:18,882 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 112753897, now seen corresponding path program 1 times [2019-11-20 08:04:18,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:18,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350525466] [2019-11-20 08:04:18,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 462 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-20 08:04:20,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350525466] [2019-11-20 08:04:20,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403556581] [2019-11-20 08:04:20,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:20,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:04:20,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-20 08:04:20,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:04:20,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 08:04:20,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373486829] [2019-11-20 08:04:20,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:04:20,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:04:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:20,816 INFO L87 Difference]: Start difference. First operand 13252 states and 14238 transitions. Second operand 3 states. [2019-11-20 08:04:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:22,008 INFO L93 Difference]: Finished difference Result 25907 states and 27873 transitions. [2019-11-20 08:04:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:04:22,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 587 [2019-11-20 08:04:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:22,033 INFO L225 Difference]: With dead ends: 25907 [2019-11-20 08:04:22,033 INFO L226 Difference]: Without dead ends: 13255 [2019-11-20 08:04:22,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 588 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-11-20 08:04:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 12654. [2019-11-20 08:04:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-11-20 08:04:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 13391 transitions. [2019-11-20 08:04:22,226 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 13391 transitions. Word has length 587 [2019-11-20 08:04:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:22,227 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 13391 transitions. [2019-11-20 08:04:22,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:04:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 13391 transitions. [2019-11-20 08:04:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-11-20 08:04:22,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:22,257 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:22,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:22,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -637061868, now seen corresponding path program 1 times [2019-11-20 08:04:22,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:22,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602514724] [2019-11-20 08:04:22,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-20 08:04:23,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602514724] [2019-11-20 08:04:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:04:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:04:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158492514] [2019-11-20 08:04:23,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:04:23,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:04:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:04:23,164 INFO L87 Difference]: Start difference. First operand 12654 states and 13391 transitions. Second operand 4 states. [2019-11-20 08:04:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:25,357 INFO L93 Difference]: Finished difference Result 27103 states and 28751 transitions. [2019-11-20 08:04:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:04:25,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 634 [2019-11-20 08:04:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:25,389 INFO L225 Difference]: With dead ends: 27103 [2019-11-20 08:04:25,389 INFO L226 Difference]: Without dead ends: 15049 [2019-11-20 08:04:25,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:04:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15049 states. [2019-11-20 08:04:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15049 to 13549. [2019-11-20 08:04:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13549 states. [2019-11-20 08:04:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13549 states to 13549 states and 14130 transitions. [2019-11-20 08:04:25,576 INFO L78 Accepts]: Start accepts. Automaton has 13549 states and 14130 transitions. Word has length 634 [2019-11-20 08:04:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:25,578 INFO L462 AbstractCegarLoop]: Abstraction has 13549 states and 14130 transitions. [2019-11-20 08:04:25,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:04:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13549 states and 14130 transitions. [2019-11-20 08:04:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2019-11-20 08:04:25,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:25,590 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:25,590 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 434787481, now seen corresponding path program 1 times [2019-11-20 08:04:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:25,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552757045] [2019-11-20 08:04:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 534 proven. 191 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 08:04:26,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552757045] [2019-11-20 08:04:26,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779845963] [2019-11-20 08:04:26,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:26,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:04:26,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:04:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 638 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 08:04:27,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:04:27,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-20 08:04:27,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939576763] [2019-11-20 08:04:27,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 08:04:27,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:04:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 08:04:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:04:27,998 INFO L87 Difference]: Start difference. First operand 13549 states and 14130 transitions. Second operand 9 states. [2019-11-20 08:04:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:04:44,700 INFO L93 Difference]: Finished difference Result 43591 states and 45334 transitions. [2019-11-20 08:04:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 08:04:44,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 670 [2019-11-20 08:04:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:04:44,740 INFO L225 Difference]: With dead ends: 43591 [2019-11-20 08:04:44,740 INFO L226 Difference]: Without dead ends: 30943 [2019-11-20 08:04:44,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=972, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 08:04:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2019-11-20 08:04:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 20433. [2019-11-20 08:04:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20433 states. [2019-11-20 08:04:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 21158 transitions. [2019-11-20 08:04:45,068 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 21158 transitions. Word has length 670 [2019-11-20 08:04:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:04:45,069 INFO L462 AbstractCegarLoop]: Abstraction has 20433 states and 21158 transitions. [2019-11-20 08:04:45,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 08:04:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 21158 transitions. [2019-11-20 08:04:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-11-20 08:04:45,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:04:45,084 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:04:45,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:45,299 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:04:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:04:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1969280993, now seen corresponding path program 1 times [2019-11-20 08:04:45,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:04:45,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923748914] [2019-11-20 08:04:45,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:04:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 590 proven. 106 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-20 08:04:47,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923748914] [2019-11-20 08:04:47,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411622581] [2019-11-20 08:04:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:04:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:04:47,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 08:04:47,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:04:47,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:04:47,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:02,565 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 45 [2019-11-20 08:05:02,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:05:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 19 refuted. 33 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-20 08:05:03,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:05:03,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-11-20 08:05:03,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334786378] [2019-11-20 08:05:03,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:05:03,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:05:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:05:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=110, Unknown=5, NotChecked=0, Total=156 [2019-11-20 08:05:03,788 INFO L87 Difference]: Start difference. First operand 20433 states and 21158 transitions. Second operand 13 states. [2019-11-20 08:05:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:14,193 INFO L93 Difference]: Finished difference Result 48271 states and 49918 transitions. [2019-11-20 08:05:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 08:05:14,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 706 [2019-11-20 08:05:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:14,215 INFO L225 Difference]: With dead ends: 48271 [2019-11-20 08:05:14,215 INFO L226 Difference]: Without dead ends: 28073 [2019-11-20 08:05:14,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 707 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=62, Invalid=205, Unknown=5, NotChecked=0, Total=272 [2019-11-20 08:05:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28073 states. [2019-11-20 08:05:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28073 to 21930. [2019-11-20 08:05:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21930 states. [2019-11-20 08:05:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21930 states to 21930 states and 22678 transitions. [2019-11-20 08:05:14,530 INFO L78 Accepts]: Start accepts. Automaton has 21930 states and 22678 transitions. Word has length 706 [2019-11-20 08:05:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:14,531 INFO L462 AbstractCegarLoop]: Abstraction has 21930 states and 22678 transitions. [2019-11-20 08:05:14,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:05:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21930 states and 22678 transitions. [2019-11-20 08:05:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-11-20 08:05:14,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:14,557 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:14,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:05:14,761 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1995279578, now seen corresponding path program 1 times [2019-11-20 08:05:14,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:05:14,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807665456] [2019-11-20 08:05:14,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:05:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-20 08:05:15,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807665456] [2019-11-20 08:05:15,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:05:15,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:05:15,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586354754] [2019-11-20 08:05:15,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:05:15,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:05:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:05:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:05:15,670 INFO L87 Difference]: Start difference. First operand 21930 states and 22678 transitions. Second operand 3 states. [2019-11-20 08:05:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:16,682 INFO L93 Difference]: Finished difference Result 35725 states and 36875 transitions. [2019-11-20 08:05:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:05:16,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 861 [2019-11-20 08:05:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:16,694 INFO L225 Difference]: With dead ends: 35725 [2019-11-20 08:05:16,694 INFO L226 Difference]: Without dead ends: 15593 [2019-11-20 08:05:16,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:05:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15593 states. [2019-11-20 08:05:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15593 to 14995. [2019-11-20 08:05:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-11-20 08:05:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 15337 transitions. [2019-11-20 08:05:16,873 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 15337 transitions. Word has length 861 [2019-11-20 08:05:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:16,874 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 15337 transitions. [2019-11-20 08:05:16,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:05:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 15337 transitions. [2019-11-20 08:05:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-11-20 08:05:16,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:16,909 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:16,909 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash -323160536, now seen corresponding path program 1 times [2019-11-20 08:05:16,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:05:16,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886288138] [2019-11-20 08:05:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:05:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1025 proven. 286 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-20 08:05:18,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886288138] [2019-11-20 08:05:18,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866790043] [2019-11-20 08:05:18,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:05:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:19,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 08:05:19,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:19,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:05:19,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 08:05:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1239 proven. 2 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-20 08:05:20,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:05:20,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-20 08:05:20,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79754236] [2019-11-20 08:05:20,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 08:05:20,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:05:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 08:05:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 08:05:20,177 INFO L87 Difference]: Start difference. First operand 14995 states and 15337 transitions. Second operand 16 states. [2019-11-20 08:05:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:05:26,652 INFO L93 Difference]: Finished difference Result 31402 states and 32111 transitions. [2019-11-20 08:05:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 08:05:26,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 896 [2019-11-20 08:05:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:05:26,665 INFO L225 Difference]: With dead ends: 31402 [2019-11-20 08:05:26,666 INFO L226 Difference]: Without dead ends: 17007 [2019-11-20 08:05:26,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 909 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 08:05:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17007 states. [2019-11-20 08:05:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17007 to 14096. [2019-11-20 08:05:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2019-11-20 08:05:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 14390 transitions. [2019-11-20 08:05:26,821 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 14390 transitions. Word has length 896 [2019-11-20 08:05:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:05:26,821 INFO L462 AbstractCegarLoop]: Abstraction has 14096 states and 14390 transitions. [2019-11-20 08:05:26,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 08:05:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 14390 transitions. [2019-11-20 08:05:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-11-20 08:05:26,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:05:26,841 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:05:27,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:05:27,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:05:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:05:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -542640556, now seen corresponding path program 1 times [2019-11-20 08:05:27,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:05:27,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111147034] [2019-11-20 08:05:27,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:05:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 1032 proven. 198 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-20 08:05:28,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111147034] [2019-11-20 08:05:28,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875176738] [2019-11-20 08:05:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:05:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:05:28,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:05:28,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:05:28,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:05:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:19,930 WARN L191 SmtUtils]: Spent 51.10 s on a formula simplification. DAG size of input: 129 DAG size of output: 37 [2019-11-20 08:06:19,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:06:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-11-20 08:06:21,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:06:21,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-11-20 08:06:21,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107532642] [2019-11-20 08:06:21,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:06:21,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:06:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:06:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:06:21,039 INFO L87 Difference]: Start difference. First operand 14096 states and 14390 transitions. Second operand 5 states. [2019-11-20 08:06:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:26,986 INFO L93 Difference]: Finished difference Result 32124 states and 32815 transitions. [2019-11-20 08:06:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:06:26,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 902 [2019-11-20 08:06:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:27,004 INFO L225 Difference]: With dead ends: 32124 [2019-11-20 08:06:27,004 INFO L226 Difference]: Without dead ends: 19793 [2019-11-20 08:06:27,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 903 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:06:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19793 states. [2019-11-20 08:06:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19793 to 16492. [2019-11-20 08:06:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16492 states. [2019-11-20 08:06:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16492 states to 16492 states and 16849 transitions. [2019-11-20 08:06:27,178 INFO L78 Accepts]: Start accepts. Automaton has 16492 states and 16849 transitions. Word has length 902 [2019-11-20 08:06:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:27,179 INFO L462 AbstractCegarLoop]: Abstraction has 16492 states and 16849 transitions. [2019-11-20 08:06:27,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:06:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 16492 states and 16849 transitions. [2019-11-20 08:06:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2019-11-20 08:06:27,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:27,195 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:27,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:06:27,396 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash 411928055, now seen corresponding path program 1 times [2019-11-20 08:06:27,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:06:27,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940682341] [2019-11-20 08:06:27,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:06:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 1024 proven. 188 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-20 08:06:28,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940682341] [2019-11-20 08:06:28,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525521270] [2019-11-20 08:06:28,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:06:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:29,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:06:29,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:29,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:29,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:46,035 WARN L191 SmtUtils]: Spent 16.79 s on a formula simplification. DAG size of input: 75 DAG size of output: 30 [2019-11-20 08:06:46,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:06:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-11-20 08:06:47,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:06:47,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-20 08:06:47,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551809162] [2019-11-20 08:06:47,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:06:47,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:06:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:06:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:06:47,364 INFO L87 Difference]: Start difference. First operand 16492 states and 16849 transitions. Second operand 5 states. [2019-11-20 08:06:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:51,595 INFO L93 Difference]: Finished difference Result 38114 states and 38955 transitions. [2019-11-20 08:06:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:06:51,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 931 [2019-11-20 08:06:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:51,617 INFO L225 Difference]: With dead ends: 38114 [2019-11-20 08:06:51,618 INFO L226 Difference]: Without dead ends: 21591 [2019-11-20 08:06:51,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:06:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21591 states. [2019-11-20 08:06:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21591 to 16193. [2019-11-20 08:06:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16193 states. [2019-11-20 08:06:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16193 states to 16193 states and 16544 transitions. [2019-11-20 08:06:51,814 INFO L78 Accepts]: Start accepts. Automaton has 16193 states and 16544 transitions. Word has length 931 [2019-11-20 08:06:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:51,815 INFO L462 AbstractCegarLoop]: Abstraction has 16193 states and 16544 transitions. [2019-11-20 08:06:51,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:06:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16193 states and 16544 transitions. [2019-11-20 08:06:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-20 08:06:51,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:51,831 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:52,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:06:52,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash 20026544, now seen corresponding path program 1 times [2019-11-20 08:06:52,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:06:52,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380142414] [2019-11-20 08:06:52,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:06:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1017 proven. 150 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-20 08:06:53,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380142414] [2019-11-20 08:06:53,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835377557] [2019-11-20 08:06:53,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:06:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:06:53,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:06:53,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:06:53,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:53,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:06:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:06:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-20 08:06:54,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:06:54,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-20 08:06:54,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195512957] [2019-11-20 08:06:54,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:06:54,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:06:54,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:06:54,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:06:54,883 INFO L87 Difference]: Start difference. First operand 16193 states and 16544 transitions. Second operand 5 states. [2019-11-20 08:06:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:06:57,954 INFO L93 Difference]: Finished difference Result 38707 states and 39580 transitions. [2019-11-20 08:06:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:06:57,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1014 [2019-11-20 08:06:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:06:57,971 INFO L225 Difference]: With dead ends: 38707 [2019-11-20 08:06:57,971 INFO L226 Difference]: Without dead ends: 22483 [2019-11-20 08:06:57,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:06:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2019-11-20 08:06:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 18886. [2019-11-20 08:06:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18886 states. [2019-11-20 08:06:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18886 states to 18886 states and 19324 transitions. [2019-11-20 08:06:58,184 INFO L78 Accepts]: Start accepts. Automaton has 18886 states and 19324 transitions. Word has length 1014 [2019-11-20 08:06:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:06:58,185 INFO L462 AbstractCegarLoop]: Abstraction has 18886 states and 19324 transitions. [2019-11-20 08:06:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:06:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18886 states and 19324 transitions. [2019-11-20 08:06:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-11-20 08:06:58,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:06:58,201 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:06:58,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:06:58,402 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:06:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:06:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2103214973, now seen corresponding path program 1 times [2019-11-20 08:06:58,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:06:58,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474307260] [2019-11-20 08:06:58,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:06:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1138 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-11-20 08:07:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474307260] [2019-11-20 08:07:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502253682] [2019-11-20 08:07:01,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:02,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:07:02,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1203 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-20 08:07:03,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:07:03,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-11-20 08:07:03,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271608643] [2019-11-20 08:07:03,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:07:03,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:07:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:07:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:07:03,075 INFO L87 Difference]: Start difference. First operand 18886 states and 19324 transitions. Second operand 5 states. [2019-11-20 08:07:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:04,473 INFO L93 Difference]: Finished difference Result 37489 states and 38363 transitions. [2019-11-20 08:07:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:07:04,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1052 [2019-11-20 08:07:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:04,487 INFO L225 Difference]: With dead ends: 37489 [2019-11-20 08:07:04,487 INFO L226 Difference]: Without dead ends: 17702 [2019-11-20 08:07:04,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 1051 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:07:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17702 states. [2019-11-20 08:07:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17702 to 17684. [2019-11-20 08:07:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2019-11-20 08:07:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 17997 transitions. [2019-11-20 08:07:04,666 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 17997 transitions. Word has length 1052 [2019-11-20 08:07:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:04,667 INFO L462 AbstractCegarLoop]: Abstraction has 17684 states and 17997 transitions. [2019-11-20 08:07:04,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:07:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 17997 transitions. [2019-11-20 08:07:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2019-11-20 08:07:04,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:07:04,681 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 08:07:04,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:04,884 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:07:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:07:04,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1579037771, now seen corresponding path program 1 times [2019-11-20 08:07:04,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:07:04,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555673400] [2019-11-20 08:07:04,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:07:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1847 backedges. 1137 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2019-11-20 08:07:05,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555673400] [2019-11-20 08:07:05,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:07:05,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:07:05,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277537111] [2019-11-20 08:07:05,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:07:05,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:07:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:07:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:07:05,994 INFO L87 Difference]: Start difference. First operand 17684 states and 17997 transitions. Second operand 3 states. [2019-11-20 08:07:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:06,975 INFO L93 Difference]: Finished difference Result 34767 states and 35393 transitions. [2019-11-20 08:07:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:07:06,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1081 [2019-11-20 08:07:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:06,988 INFO L225 Difference]: With dead ends: 34767 [2019-11-20 08:07:06,988 INFO L226 Difference]: Without dead ends: 17384 [2019-11-20 08:07:06,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:07:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17384 states. [2019-11-20 08:07:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17384 to 17085. [2019-11-20 08:07:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17085 states. [2019-11-20 08:07:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17085 states to 17085 states and 17390 transitions. [2019-11-20 08:07:07,177 INFO L78 Accepts]: Start accepts. Automaton has 17085 states and 17390 transitions. Word has length 1081 [2019-11-20 08:07:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:07,178 INFO L462 AbstractCegarLoop]: Abstraction has 17085 states and 17390 transitions. [2019-11-20 08:07:07,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:07:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17085 states and 17390 transitions. [2019-11-20 08:07:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-11-20 08:07:07,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:07:07,198 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:07:07,198 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:07:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:07:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash -733344715, now seen corresponding path program 1 times [2019-11-20 08:07:07,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:07:07,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350720713] [2019-11-20 08:07:07,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:07:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 1439 proven. 102 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-11-20 08:07:10,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350720713] [2019-11-20 08:07:10,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532421240] [2019-11-20 08:07:10,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:10,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:07:10,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:10,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:27,468 WARN L191 SmtUtils]: Spent 16.87 s on a formula simplification. DAG size of input: 96 DAG size of output: 30 [2019-11-20 08:07:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-11-20 08:07:28,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:07:28,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-20 08:07:28,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238539085] [2019-11-20 08:07:28,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:07:28,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:07:28,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:07:28,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:07:28,460 INFO L87 Difference]: Start difference. First operand 17085 states and 17390 transitions. Second operand 4 states. [2019-11-20 08:07:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:32,425 INFO L93 Difference]: Finished difference Result 36271 states and 36911 transitions. [2019-11-20 08:07:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:07:32,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1102 [2019-11-20 08:07:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:32,438 INFO L225 Difference]: With dead ends: 36271 [2019-11-20 08:07:32,438 INFO L226 Difference]: Without dead ends: 18889 [2019-11-20 08:07:32,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:07:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-11-20 08:07:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 11097. [2019-11-20 08:07:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-11-20 08:07:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 11259 transitions. [2019-11-20 08:07:32,587 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 11259 transitions. Word has length 1102 [2019-11-20 08:07:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:32,588 INFO L462 AbstractCegarLoop]: Abstraction has 11097 states and 11259 transitions. [2019-11-20 08:07:32,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:07:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 11259 transitions. [2019-11-20 08:07:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1191 [2019-11-20 08:07:32,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:07:32,609 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:07:32,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:32,813 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:07:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:07:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1950595044, now seen corresponding path program 1 times [2019-11-20 08:07:32,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:07:32,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363764498] [2019-11-20 08:07:32,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:07:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1362 proven. 237 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-20 08:07:34,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363764498] [2019-11-20 08:07:34,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567237023] [2019-11-20 08:07:34,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:34,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:07:34,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:07:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-20 08:07:36,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:07:36,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-20 08:07:36,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119160761] [2019-11-20 08:07:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:07:36,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:07:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:07:36,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:07:36,201 INFO L87 Difference]: Start difference. First operand 11097 states and 11259 transitions. Second operand 5 states. [2019-11-20 08:07:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:38,676 INFO L93 Difference]: Finished difference Result 26722 states and 27120 transitions. [2019-11-20 08:07:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:07:38,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1190 [2019-11-20 08:07:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:38,687 INFO L225 Difference]: With dead ends: 26722 [2019-11-20 08:07:38,688 INFO L226 Difference]: Without dead ends: 15594 [2019-11-20 08:07:38,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:07:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15594 states. [2019-11-20 08:07:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15594 to 11398. [2019-11-20 08:07:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11398 states. [2019-11-20 08:07:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11398 states to 11398 states and 11565 transitions. [2019-11-20 08:07:38,808 INFO L78 Accepts]: Start accepts. Automaton has 11398 states and 11565 transitions. Word has length 1190 [2019-11-20 08:07:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:38,809 INFO L462 AbstractCegarLoop]: Abstraction has 11398 states and 11565 transitions. [2019-11-20 08:07:38,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:07:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11398 states and 11565 transitions. [2019-11-20 08:07:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1516 [2019-11-20 08:07:38,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:07:38,827 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:07:39,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:39,028 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:07:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:07:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1118426668, now seen corresponding path program 1 times [2019-11-20 08:07:39,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:07:39,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140696752] [2019-11-20 08:07:39,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:07:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3452 backedges. 2167 proven. 529 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-11-20 08:07:41,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140696752] [2019-11-20 08:07:41,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344004338] [2019-11-20 08:07:41,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:07:41,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 08:07:41,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:07:41,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:41,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:07:43,784 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-11-20 08:07:43,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 08:07:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3452 backedges. 2361 proven. 19 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-11-20 08:07:46,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:07:46,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 08:07:46,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381319214] [2019-11-20 08:07:46,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 08:07:46,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:07:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 08:07:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:07:46,044 INFO L87 Difference]: Start difference. First operand 11398 states and 11565 transitions. Second operand 10 states. [2019-11-20 08:07:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:07:49,923 INFO L93 Difference]: Finished difference Result 26730 states and 27125 transitions. [2019-11-20 08:07:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 08:07:49,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1515 [2019-11-20 08:07:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:07:49,925 INFO L225 Difference]: With dead ends: 26730 [2019-11-20 08:07:49,925 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 08:07:49,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1528 GetRequests, 1516 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-11-20 08:07:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 08:07:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 08:07:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 08:07:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 08:07:49,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1515 [2019-11-20 08:07:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:07:49,933 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:07:49,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 08:07:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:07:49,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 08:07:50,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:07:50,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 08:07:52,030 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 976 DAG size of output: 791 [2019-11-20 08:07:53,335 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 976 DAG size of output: 791 [2019-11-20 08:07:53,938 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 708 DAG size of output: 592 [2019-11-20 08:08:00,234 WARN L191 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 750 DAG size of output: 175 [2019-11-20 08:08:06,649 WARN L191 SmtUtils]: Spent 6.41 s on a formula simplification. DAG size of input: 750 DAG size of output: 175 [2019-11-20 08:08:10,669 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 567 DAG size of output: 178 [2019-11-20 08:08:10,672 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,672 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,672 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,672 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,672 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,673 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 08:08:10,674 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 08:08:10,675 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,676 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 08:08:10,677 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,678 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,679 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 08:08:10,680 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 169) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,681 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 08:08:10,682 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,683 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 08:08:10,684 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,685 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,686 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,687 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,688 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 08:08:10,689 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,690 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,691 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,692 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,693 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,694 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 08:08:10,695 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 08:08:10,696 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 08:08:10,697 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,698 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 08:08:10,699 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 08:08:10,700 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 08:08:10,700 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,700 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,700 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,700 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,701 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse28 (+ ~a29~0 144)) (.cse29 (+ ~a29~0 16))) (let ((.cse21 (<= .cse29 0)) (.cse27 (< 0 .cse28))) (let ((.cse25 (+ ~a29~0 127)) (.cse6 (= ~a2~0 1)) (.cse18 (<= (+ ~a0~0 147) 0)) (.cse4 (and .cse21 .cse27)) (.cse23 (not (= ~a2~0 3)))) (let ((.cse1 (< 0 .cse29)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse2 (= 4 ~a2~0)) (.cse20 (<= ~a0~0 599920)) (.cse19 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse12 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse3 (<= 0 (+ ~a0~0 146))) (.cse22 (<= (+ ~a0~0 61) 0)) (.cse7 (<= ~a0~0 599997)) (.cse15 (<= .cse28 0)) (.cse9 (<= (+ ~a4~0 86) 0)) (.cse8 (<= 2 ~a2~0)) (.cse10 (<= ~a2~0 3)) (.cse16 (and .cse18 .cse4 .cse23)) (.cse5 (= 5 ~a2~0)) (.cse14 (and .cse6 .cse27 .cse18)) (.cse26 (<= (+ ~a0~0 149) 0)) (.cse11 (<= 0 .cse25))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3) (and .cse7 (and .cse8 .cse9 .cse10 .cse11)) (and .cse7 (or (and .cse9 .cse1 (<= ~a29~0 42) .cse2) (and (and (and .cse9 .cse4) .cse12) .cse2))) (and (exists ((v_~a0~0_829 Int)) (let ((.cse13 (div v_~a0~0_829 5))) (and (<= v_~a0~0_829 599920) (not (= 0 (mod (+ .cse13 3) 5))) (< .cse13 278886) (<= ~a0~0 (+ (div (+ .cse13 (- 278887)) 5) 1)) (not (= (mod (+ .cse13 4) 5) 0)) (< .cse13 278887) (<= 0 v_~a0~0_829)))) .cse14) (and (and (or .cse15 (and (<= (+ ~a0~0 242851) 0) .cse16)) .cse2) (exists ((v_~a0~0_836 Int)) (let ((.cse17 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse17 (- 278887)) 5) 1)) (< .cse17 278887) (not (= (mod (+ .cse17 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse17 3) 5) 0)) (< .cse17 278886) (<= v_~a0~0_836 599999))))) (and (or (< 0 (+ ~a4~0 42)) (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse1 .cse18 .cse2) (and .cse0 .cse5 .cse19 .cse3) (and .cse8 .cse0 .cse11 (<= ~a2~0 2)) (and .cse0 (and .cse10 (<= 3 ~a2~0))) (and .cse0 .cse3 .cse5 .cse11) (and .cse9 .cse20 .cse19 (= 3 ~a2~0)) (and .cse7 (and .cse9 (or (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse21) .cse5 .cse11)) (and .cse9 .cse2 .cse20 .cse19 .cse12) (and .cse22 .cse6 .cse3 .cse4) (and .cse9 .cse22) (and .cse7 (and .cse15 (and .cse8 .cse23 .cse9 .cse10))) (and .cse8 .cse18 .cse10) (let ((.cse24 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse24) .cse11 .cse6 (<= .cse25 0) (<= .cse24 0))) (and .cse26 (and .cse16 .cse5)) (and .cse26 (and .cse5 .cse11)) (and .cse14 .cse26 .cse11)))))) [2019-11-20 08:08:10,701 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 08:08:10,701 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,702 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 08:08:10,703 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,704 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 08:08:10,705 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,706 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,706 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,706 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,706 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,706 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,707 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse25 (+ ~a29~0 144)) (.cse23 (+ ~a29~0 127))) (let ((.cse12 (<= (+ ~a4~0 86) 0)) (.cse2 (<= 0 .cse23)) (.cse4 (= ~a2~0 1)) (.cse27 (< 0 .cse25)) (.cse18 (<= (+ ~a0~0 147) 0)) (.cse26 (+ ~a29~0 16))) (let ((.cse6 (< 0 .cse26)) (.cse13 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse17 (<= ~a0~0 599920)) (.cse10 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse1 (and .cse4 .cse27 .cse18)) (.cse8 (and (<= .cse26 0) .cse27)) (.cse3 (<= (+ ~a0~0 98) 0)) (.cse5 (<= 0 (+ ~a0~0 146))) (.cse15 (<= 2 ~a2~0)) (.cse16 (<= ~a2~0 3)) (.cse0 (<= (+ ~a0~0 149) 0)) (.cse14 (<= .cse25 0)) (.cse7 (= 4 ~a2~0)) (.cse11 (<= ~a0~0 599997)) (.cse9 (= 5 ~a2~0)) (.cse21 (and .cse12 .cse2))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7) (and .cse3 .cse5 .cse8 .cse9) (and .cse3 .cse9 .cse10 .cse5) (and .cse11 (or (and (and (and .cse12 .cse8) .cse13) .cse7) (and .cse6 (<= ~a29~0 42) .cse7 .cse12))) (and (and .cse14 (and .cse15 (not (= ~a2~0 3)) .cse12 .cse16)) .cse11) (and .cse12 .cse7 .cse17 .cse10 .cse13) (and .cse15 .cse3 .cse2 (<= ~a2~0 2)) (and .cse12 .cse17 .cse10 (= 3 ~a2~0)) (and .cse15 .cse18 .cse16) (and .cse19 .cse4 .cse5 .cse8) (and .cse12 .cse19) (and (exists ((v_~a0~0_829 Int)) (let ((.cse20 (div v_~a0~0_829 5))) (and (<= v_~a0~0_829 599920) (not (= 0 (mod (+ .cse20 3) 5))) (< .cse20 278886) (<= ~a0~0 (+ (div (+ .cse20 (- 278887)) 5) 1)) (not (= (mod (+ .cse20 4) 5) 0)) (< .cse20 278887) (<= 0 v_~a0~0_829)))) .cse1) (and (and .cse21 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse9) .cse11) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse22) .cse2 .cse4 (<= .cse23 0) (<= .cse22 0))) (and .cse0 (and .cse8 .cse9)) (and .cse3 (and .cse16 (<= 3 ~a2~0))) (and .cse9 (and .cse3 .cse5 .cse2)) (and .cse11 (and .cse15 .cse12 .cse16 .cse2)) (and .cse0 (and .cse2 .cse9)) (and (and (or .cse14 (<= (+ ~a0~0 242851) 0)) .cse7) (exists ((v_~a0~0_836 Int)) (let ((.cse24 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (< .cse24 278887) (not (= (mod (+ .cse24 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (<= v_~a0~0_836 599999))))) (and .cse11 (and .cse9 .cse21 (<= ~a29~0 43))))))) [2019-11-20 08:08:10,707 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,707 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,708 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,709 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,710 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,711 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,712 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,713 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,714 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,715 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 08:08:10,716 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,717 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,718 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,718 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse25 (+ ~a29~0 144)) (.cse23 (+ ~a29~0 127))) (let ((.cse12 (<= (+ ~a4~0 86) 0)) (.cse2 (<= 0 .cse23)) (.cse4 (= ~a2~0 1)) (.cse27 (< 0 .cse25)) (.cse18 (<= (+ ~a0~0 147) 0)) (.cse26 (+ ~a29~0 16))) (let ((.cse6 (< 0 .cse26)) (.cse13 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse17 (<= ~a0~0 599920)) (.cse10 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse19 (<= (+ ~a0~0 61) 0)) (.cse1 (and .cse4 .cse27 .cse18)) (.cse8 (and (<= .cse26 0) .cse27)) (.cse3 (<= (+ ~a0~0 98) 0)) (.cse5 (<= 0 (+ ~a0~0 146))) (.cse15 (<= 2 ~a2~0)) (.cse16 (<= ~a2~0 3)) (.cse0 (<= (+ ~a0~0 149) 0)) (.cse14 (<= .cse25 0)) (.cse7 (= 4 ~a2~0)) (.cse11 (<= ~a0~0 599997)) (.cse9 (= 5 ~a2~0)) (.cse21 (and .cse12 .cse2))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7) (and .cse3 .cse5 .cse8 .cse9) (and .cse3 .cse9 .cse10 .cse5) (and .cse11 (or (and (and (and .cse12 .cse8) .cse13) .cse7) (and .cse6 (<= ~a29~0 42) .cse7 .cse12))) (and (and .cse14 (and .cse15 (not (= ~a2~0 3)) .cse12 .cse16)) .cse11) (and .cse12 .cse7 .cse17 .cse10 .cse13) (and .cse15 .cse3 .cse2 (<= ~a2~0 2)) (and .cse12 .cse17 .cse10 (= 3 ~a2~0)) (and .cse15 .cse18 .cse16) (and .cse19 .cse4 .cse5 .cse8) (and .cse12 .cse19) (and (exists ((v_~a0~0_829 Int)) (let ((.cse20 (div v_~a0~0_829 5))) (and (<= v_~a0~0_829 599920) (not (= 0 (mod (+ .cse20 3) 5))) (< .cse20 278886) (<= ~a0~0 (+ (div (+ .cse20 (- 278887)) 5) 1)) (not (= (mod (+ .cse20 4) 5) 0)) (< .cse20 278887) (<= 0 v_~a0~0_829)))) .cse1) (and (and .cse21 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse9) .cse11) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse22) .cse2 .cse4 (<= .cse23 0) (<= .cse22 0))) (and .cse0 (and .cse8 .cse9)) (and .cse3 (and .cse16 (<= 3 ~a2~0))) (and .cse9 (and .cse3 .cse5 .cse2)) (and .cse11 (and .cse15 .cse12 .cse16 .cse2)) (and .cse0 (and .cse2 .cse9)) (and (and (or .cse14 (<= (+ ~a0~0 242851) 0)) .cse7) (exists ((v_~a0~0_836 Int)) (let ((.cse24 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (< .cse24 278887) (not (= (mod (+ .cse24 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (<= v_~a0~0_836 599999))))) (and .cse11 (and .cse9 .cse21 (<= ~a29~0 43))))))) [2019-11-20 08:08:10,718 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,719 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,720 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,721 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,722 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,723 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 08:08:10,724 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 08:08:10,725 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,726 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 08:08:10,727 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,728 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,729 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,730 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,731 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 08:08:10,732 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,733 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,733 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 08:08:10,733 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 08:08:10,733 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 08:08:10,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,750 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,781 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:10,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:10,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:10,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:08:10 BoogieIcfgContainer [2019-11-20 08:08:10,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:08:10,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:08:10,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:08:10,816 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:08:10,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:44" (3/4) ... [2019-11-20 08:08:10,820 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 08:08:10,852 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 08:08:10,856 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 08:08:10,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a0 + 149 <= 0 && ((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a29 + 127) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)))) || ((a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3) && a0 <= 599997)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && 0 <= a29 + 127) && !(6 == input)) && 5 == a2) && a0 <= 599997)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && (a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 + 149 <= 0 && 0 <= a29 + 127 && 5 == a2)) || (((a29 + 144 <= 0 || a0 + 242851 <= 0) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || (a0 <= 599997 && (5 == a2 && a4 + 86 <= 0 && 0 <= a29 + 127) && a29 <= 43) [2019-11-20 08:08:10,892 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a0 + 149 <= 0 && ((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a29 + 127) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)))) || ((a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3) && a0 <= 599997)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && 0 <= a29 + 127) && !(6 == input)) && 5 == a2) && a0 <= 599997)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && (a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 + 149 <= 0 && 0 <= a29 + 127 && 5 == a2)) || (((a29 + 144 <= 0 || a0 + 242851 <= 0) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || (a0 <= 599997 && (5 == a2 && a4 + 86 <= 0 && 0 <= a29 + 127) && a29 <= 43) [2019-11-20 08:08:10,904 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2) && 0 <= a0 + 146) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 4 == a2) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || (((a29 + 144 <= 0 || (a0 + 242851 <= 0 && (a0 + 147 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3))) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || ((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || (a0 <= 599997 && ((a4 + 86 <= 0 && (!(6 == input) || a29 + 16 <= 0)) && 5 == a2) && 0 <= a29 + 127)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599997 && a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && ((a0 + 147 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && 5 == a2)) || (a0 + 149 <= 0 && 5 == a2 && 0 <= a29 + 127)) || ((((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && a0 + 149 <= 0) && 0 <= a29 + 127) [2019-11-20 08:08:11,094 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_437c63b7-14fa-4874-90a1-ad3a110c2082/bin/uautomizer/witness.graphml [2019-11-20 08:08:11,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:08:11,095 INFO L168 Benchmark]: Toolchain (without parser) took 272634.36 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 939.3 MB in the beginning and 1.8 GB in the end (delta: -860.9 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,096 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:08:11,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1266.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 207.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,097 INFO L168 Benchmark]: Boogie Preprocessor took 174.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,097 INFO L168 Benchmark]: RCFGBuilder took 3969.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,097 INFO L168 Benchmark]: TraceAbstraction took 266734.14 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -798.8 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,098 INFO L168 Benchmark]: Witness Printer took 278.65 ms. Allocated memory is still 4.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:08:11,100 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1266.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 207.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 174.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3969.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 266734.14 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -798.8 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 278.65 ms. Allocated memory is still 4.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 106.0 MB). Peak memory consumption was 106.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_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 169]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-20 08:08:11,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a0 + 149 <= 0 && ((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a29 + 127) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)))) || ((a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3) && a0 <= 599997)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && 0 <= a29 + 127) && !(6 == input)) && 5 == a2) && a0 <= 599997)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && (a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 + 149 <= 0 && 0 <= a29 + 127 && 5 == a2)) || (((a29 + 144 <= 0 || a0 + 242851 <= 0) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || (a0 <= 599997 && (5 == a2 && a4 + 86 <= 0 && 0 <= a29 + 127) && a29 <= 43) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 08:08:11,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a0 + 149 <= 0 && ((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a29 + 127) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)))) || ((a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3) && a0 <= 599997)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && 0 <= a29 + 127) && !(6 == input)) && 5 == a2) && a0 <= 599997)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && (a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 + 149 <= 0 && 0 <= a29 + 127 && 5 == a2)) || (((a29 + 144 <= 0 || a0 + 242851 <= 0) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || (a0 <= 599997 && (5 == a2 && a4 + 86 <= 0 && 0 <= a29 + 127) && a29 <= 43) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 08:08:11,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_829,QUANTIFIED] [2019-11-20 08:08:11,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-20 08:08:11,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-20 08:08:11,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a0 + 98 <= 0 && 0 < a29 + 16) && 4 == a2) && 0 <= a0 + 146) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146)) || (a0 <= 599997 && ((2 <= a2 && a4 + 86 <= 0) && a2 <= 3) && 0 <= a29 + 127)) || (a0 <= 599997 && ((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 4 == a2) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((\exists v_~a0~0_829 : int :: (((((v_~a0~0_829 <= 599920 && !(0 == (v_~a0~0_829 / 5 + 3) % 5)) && v_~a0~0_829 / 5 < 278886) && a0 <= (v_~a0~0_829 / 5 + -278887) / 5 + 1) && !((v_~a0~0_829 / 5 + 4) % 5 == 0)) && v_~a0~0_829 / 5 < 278887) && 0 <= v_~a0~0_829) && (a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0)) || (((a29 + 144 <= 0 || (a0 + 242851 <= 0 && (a0 + 147 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3))) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999))) || ((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || (((a0 + 98 <= 0 && 5 == a2) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 0 <= a0 + 146)) || (((2 <= a2 && a0 + 98 <= 0) && 0 <= a29 + 127) && a2 <= 2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || (((a4 + 86 <= 0 && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 3 == a2)) || (a0 <= 599997 && ((a4 + 86 <= 0 && (!(6 == input) || a29 + 16 <= 0)) && 5 == a2) && 0 <= a29 + 127)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (((a0 + 61 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599997 && a29 + 144 <= 0 && ((2 <= a2 && !(a2 == 3)) && a4 + 86 <= 0) && a2 <= 3)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 3)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (a0 + 149 <= 0 && ((a0 + 147 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && 5 == a2)) || (a0 + 149 <= 0 && 5 == a2 && 0 <= a29 + 127)) || ((((a2 == 1 && 0 < a29 + 144) && a0 + 147 <= 0) && a0 + 149 <= 0) && 0 <= a29 + 127) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 266.5s, OverallIterations: 23, TraceHistogramMax: 7, AutomataDifference: 91.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.5s, HoareTripleCheckerStatistics: 4122 SDtfs, 28121 SDslu, 1932 SDs, 0 SdLazy, 65463 SolverSat, 5687 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 73.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11754 GetRequests, 11520 SyntacticMatches, 42 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 106.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21930occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 50562 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 258 NumberOfFragments, 1858 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1334798 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2023302 FormulaSimplificationTreeSizeReductionInter, 16.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 125.1s InterpolantComputationTime, 26866 NumberOfCodeBlocks, 26866 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 26830 ConstructedInterpolants, 649 QuantifiedInterpolants, 90167844 SizeOfPredicates, 30 NumberOfNonLiveVariables, 13246 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 36 InterpolantComputations, 19 PerfectInterpolantSequences, 39311/42055 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...