./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem18_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem18_label07.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/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 40c9463fc988555c5bbf5eca12bf70974b14d395 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:38:46,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:38:46,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:38:46,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:38:46,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:38:46,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:38:47,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:38:47,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:38:47,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:38:47,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:38:47,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:38:47,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:38:47,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:38:47,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:38:47,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:38:47,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:38:47,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:38:47,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:38:47,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:38:47,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:38:47,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:38:47,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:38:47,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:38:47,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:38:47,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:38:47,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:38:47,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:38:47,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:38:47,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:38:47,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:38:47,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:38:47,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:38:47,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:38:47,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:38:47,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:38:47,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:38:47,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:38:47,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:38:47,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:38:47,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:38:47,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:38:47,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:38:47,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:38:47,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:38:47,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:38:47,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:38:47,092 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:38:47,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:38:47,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:38:47,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:38:47,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:38:47,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:38:47,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:38:47,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:38:47,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:38:47,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:38:47,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:38:47,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:38:47,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:38:47,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:38:47,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:38:47,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:38:47,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:38:47,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:38:47,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:38:47,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:38:47,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:38:47,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:38:47,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:38:47,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:38:47,099 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_9d2bc070-a382-48bc-a4ac-7c6310c4b984/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 -> 40c9463fc988555c5bbf5eca12bf70974b14d395 [2019-11-15 20:38:47,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:38:47,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:38:47,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:38:47,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:38:47,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:38:47,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem18_label07.c [2019-11-15 20:38:47,213 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/data/a8eccfb8d/b40feeef2659464183149f63d7ad2600/FLAG13da33d51 [2019-11-15 20:38:47,827 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:38:47,828 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/sv-benchmarks/c/eca-rers2012/Problem18_label07.c [2019-11-15 20:38:47,863 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/data/a8eccfb8d/b40feeef2659464183149f63d7ad2600/FLAG13da33d51 [2019-11-15 20:38:47,997 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/data/a8eccfb8d/b40feeef2659464183149f63d7ad2600 [2019-11-15 20:38:47,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:38:48,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:38:48,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:38:48,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:38:48,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:38:48,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:38:47" (1/1) ... [2019-11-15 20:38:48,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302727f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:48, skipping insertion in model container [2019-11-15 20:38:48,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:38:47" (1/1) ... [2019-11-15 20:38:48,018 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:38:48,126 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:38:49,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:38:49,202 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:38:49,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:38:49,626 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:38:49,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49 WrapperNode [2019-11-15 20:38:49,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:38:49,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:38:49,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:38:49,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:38:49,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:38:49,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:38:49,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:38:49,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:38:49,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:49,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:50,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:50,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... [2019-11-15 20:38:50,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:38:50,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:38:50,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:38:50,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:38:50,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:38:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:38:50,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:38:54,006 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:38:54,007 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 20:38:54,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:54 BoogieIcfgContainer [2019-11-15 20:38:54,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:38:54,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:38:54,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:38:54,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:38:54,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:38:47" (1/3) ... [2019-11-15 20:38:54,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e359664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:38:54, skipping insertion in model container [2019-11-15 20:38:54,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:38:49" (2/3) ... [2019-11-15 20:38:54,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e359664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:38:54, skipping insertion in model container [2019-11-15 20:38:54,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:54" (3/3) ... [2019-11-15 20:38:54,016 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label07.c [2019-11-15 20:38:54,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:38:54,032 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:38:54,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:38:54,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:38:54,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:38:54,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:38:54,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:38:54,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:38:54,078 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:38:54,078 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:38:54,079 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:38:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states. [2019-11-15 20:38:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:38:54,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:38:54,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:38:54,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:38:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:38:54,129 INFO L82 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2019-11-15 20:38:54,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:38:54,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998114064] [2019-11-15 20:38:54,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:54,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:38:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:38:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:38:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:38:54,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998114064] [2019-11-15 20:38:54,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:38:54,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:38:54,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623163191] [2019-11-15 20:38:54,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:38:54,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:38:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:38:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:38:54,593 INFO L87 Difference]: Start difference. First operand 757 states. Second operand 6 states. [2019-11-15 20:39:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:03,225 INFO L93 Difference]: Finished difference Result 2900 states and 5648 transitions. [2019-11-15 20:39:03,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:39:03,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-15 20:39:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:03,259 INFO L225 Difference]: With dead ends: 2900 [2019-11-15 20:39:03,260 INFO L226 Difference]: Without dead ends: 2074 [2019-11-15 20:39:03,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:39:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-11-15 20:39:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2019-11-15 20:39:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-15 20:39:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3220 transitions. [2019-11-15 20:39:03,404 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3220 transitions. Word has length 47 [2019-11-15 20:39:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 3220 transitions. [2019-11-15 20:39:03,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:39:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3220 transitions. [2019-11-15 20:39:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 20:39:03,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:03,412 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:39:03,413 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1318536312, now seen corresponding path program 1 times [2019-11-15 20:39:03,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:03,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996689641] [2019-11-15 20:39:03,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:03,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:03,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:03,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996689641] [2019-11-15 20:39:03,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:03,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:03,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368763309] [2019-11-15 20:39:03,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:39:03,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:39:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:39:03,787 INFO L87 Difference]: Start difference. First operand 2074 states and 3220 transitions. Second operand 5 states. [2019-11-15 20:39:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:08,838 INFO L93 Difference]: Finished difference Result 6216 states and 9540 transitions. [2019-11-15 20:39:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:08,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-11-15 20:39:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:08,861 INFO L225 Difference]: With dead ends: 6216 [2019-11-15 20:39:08,861 INFO L226 Difference]: Without dead ends: 4144 [2019-11-15 20:39:08,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2019-11-15 20:39:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4144. [2019-11-15 20:39:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-11-15 20:39:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5434 transitions. [2019-11-15 20:39:08,948 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5434 transitions. Word has length 140 [2019-11-15 20:39:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:08,949 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 5434 transitions. [2019-11-15 20:39:08,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:39:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5434 transitions. [2019-11-15 20:39:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 20:39:08,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:08,954 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:39:08,954 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 926922057, now seen corresponding path program 1 times [2019-11-15 20:39:08,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:08,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614993213] [2019-11-15 20:39:08,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:08,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:08,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:09,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614993213] [2019-11-15 20:39:09,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:09,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:09,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472296677] [2019-11-15 20:39:09,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:39:09,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:09,233 INFO L87 Difference]: Start difference. First operand 4144 states and 5434 transitions. Second operand 4 states. [2019-11-15 20:39:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:13,845 INFO L93 Difference]: Finished difference Result 11736 states and 16718 transitions. [2019-11-15 20:39:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:13,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-15 20:39:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:13,886 INFO L225 Difference]: With dead ends: 11736 [2019-11-15 20:39:13,887 INFO L226 Difference]: Without dead ends: 8284 [2019-11-15 20:39:13,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2019-11-15 20:39:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 7594. [2019-11-15 20:39:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7594 states. [2019-11-15 20:39:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7594 states to 7594 states and 10546 transitions. [2019-11-15 20:39:14,043 INFO L78 Accepts]: Start accepts. Automaton has 7594 states and 10546 transitions. Word has length 229 [2019-11-15 20:39:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:14,044 INFO L462 AbstractCegarLoop]: Abstraction has 7594 states and 10546 transitions. [2019-11-15 20:39:14,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:39:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7594 states and 10546 transitions. [2019-11-15 20:39:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-15 20:39:14,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:14,053 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:14,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1679191349, now seen corresponding path program 1 times [2019-11-15 20:39:14,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:14,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277730298] [2019-11-15 20:39:14,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 176 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:14,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277730298] [2019-11-15 20:39:14,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396418871] [2019-11-15 20:39:14,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:14,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:14,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-15 20:39:14,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:39:14,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-15 20:39:14,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139480057] [2019-11-15 20:39:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:39:14,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:14,891 INFO L87 Difference]: Start difference. First operand 7594 states and 10546 transitions. Second operand 3 states. [2019-11-15 20:39:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:17,870 INFO L93 Difference]: Finished difference Result 20016 states and 28837 transitions. [2019-11-15 20:39:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:17,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-15 20:39:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:17,929 INFO L225 Difference]: With dead ends: 20016 [2019-11-15 20:39:17,929 INFO L226 Difference]: Without dead ends: 13114 [2019-11-15 20:39:17,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2019-11-15 20:39:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 10354. [2019-11-15 20:39:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10354 states. [2019-11-15 20:39:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10354 states to 10354 states and 13607 transitions. [2019-11-15 20:39:18,144 INFO L78 Accepts]: Start accepts. Automaton has 10354 states and 13607 transitions. Word has length 320 [2019-11-15 20:39:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:18,145 INFO L462 AbstractCegarLoop]: Abstraction has 10354 states and 13607 transitions. [2019-11-15 20:39:18,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:39:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10354 states and 13607 transitions. [2019-11-15 20:39:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-11-15 20:39:18,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:18,153 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:18,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:18,366 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -793301092, now seen corresponding path program 1 times [2019-11-15 20:39:18,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:18,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433647935] [2019-11-15 20:39:18,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:18,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:18,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 290 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 20:39:18,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433647935] [2019-11-15 20:39:18,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697533046] [2019-11-15 20:39:18,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:18,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:18,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 20:39:19,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:39:19,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:39:19,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34464277] [2019-11-15 20:39:19,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:39:19,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:19,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:19,109 INFO L87 Difference]: Start difference. First operand 10354 states and 13607 transitions. Second operand 3 states. [2019-11-15 20:39:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:21,777 INFO L93 Difference]: Finished difference Result 27606 states and 37221 transitions. [2019-11-15 20:39:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:21,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-11-15 20:39:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:21,812 INFO L225 Difference]: With dead ends: 27606 [2019-11-15 20:39:21,813 INFO L226 Difference]: Without dead ends: 17944 [2019-11-15 20:39:21,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17944 states. [2019-11-15 20:39:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17944 to 16564. [2019-11-15 20:39:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16564 states. [2019-11-15 20:39:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 20777 transitions. [2019-11-15 20:39:22,102 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 20777 transitions. Word has length 384 [2019-11-15 20:39:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:22,103 INFO L462 AbstractCegarLoop]: Abstraction has 16564 states and 20777 transitions. [2019-11-15 20:39:22,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:39:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 20777 transitions. [2019-11-15 20:39:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-11-15 20:39:22,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:22,115 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:22,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:22,319 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1297884220, now seen corresponding path program 1 times [2019-11-15 20:39:22,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:22,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585558889] [2019-11-15 20:39:22,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:22,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:22,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 442 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-15 20:39:22,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585558889] [2019-11-15 20:39:22,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832181502] [2019-11-15 20:39:22,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:23,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:23,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-15 20:39:23,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:39:23,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:39:23,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743971928] [2019-11-15 20:39:23,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:39:23,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:23,346 INFO L87 Difference]: Start difference. First operand 16564 states and 20777 transitions. Second operand 3 states. [2019-11-15 20:39:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:25,865 INFO L93 Difference]: Finished difference Result 35196 states and 43802 transitions. [2019-11-15 20:39:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:25,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2019-11-15 20:39:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:25,888 INFO L225 Difference]: With dead ends: 35196 [2019-11-15 20:39:25,888 INFO L226 Difference]: Without dead ends: 16564 [2019-11-15 20:39:25,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:39:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16564 states. [2019-11-15 20:39:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16564 to 15874. [2019-11-15 20:39:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15874 states. [2019-11-15 20:39:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 17000 transitions. [2019-11-15 20:39:26,091 INFO L78 Accepts]: Start accepts. Automaton has 15874 states and 17000 transitions. Word has length 486 [2019-11-15 20:39:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:26,092 INFO L462 AbstractCegarLoop]: Abstraction has 15874 states and 17000 transitions. [2019-11-15 20:39:26,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:39:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15874 states and 17000 transitions. [2019-11-15 20:39:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2019-11-15 20:39:26,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:26,138 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 20:39:26,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:26,345 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2128477721, now seen corresponding path program 1 times [2019-11-15 20:39:26,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:26,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324759831] [2019-11-15 20:39:26,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:26,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:26,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-11-15 20:39:27,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324759831] [2019-11-15 20:39:27,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:27,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:27,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282258004] [2019-11-15 20:39:27,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:39:27,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:27,744 INFO L87 Difference]: Start difference. First operand 15874 states and 17000 transitions. Second operand 4 states. [2019-11-15 20:39:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:31,605 INFO L93 Difference]: Finished difference Result 42096 states and 45887 transitions. [2019-11-15 20:39:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:31,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1088 [2019-11-15 20:39:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:31,632 INFO L225 Difference]: With dead ends: 42096 [2019-11-15 20:39:31,633 INFO L226 Difference]: Without dead ends: 26914 [2019-11-15 20:39:31,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2019-11-15 20:39:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 20704. [2019-11-15 20:39:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20704 states. [2019-11-15 20:39:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 22085 transitions. [2019-11-15 20:39:31,880 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 22085 transitions. Word has length 1088 [2019-11-15 20:39:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:31,882 INFO L462 AbstractCegarLoop]: Abstraction has 20704 states and 22085 transitions. [2019-11-15 20:39:31,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:39:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 22085 transitions. [2019-11-15 20:39:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-11-15 20:39:31,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:31,900 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 20:39:31,900 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -302024924, now seen corresponding path program 1 times [2019-11-15 20:39:31,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:31,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999615379] [2019-11-15 20:39:31,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:31,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:31,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-11-15 20:39:33,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999615379] [2019-11-15 20:39:33,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:33,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:33,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456229403] [2019-11-15 20:39:33,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:39:33,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:33,371 INFO L87 Difference]: Start difference. First operand 20704 states and 22085 transitions. Second operand 4 states. [2019-11-15 20:39:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:36,540 INFO L93 Difference]: Finished difference Result 53826 states and 57312 transitions. [2019-11-15 20:39:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:36,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1102 [2019-11-15 20:39:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:36,573 INFO L225 Difference]: With dead ends: 53826 [2019-11-15 20:39:36,573 INFO L226 Difference]: Without dead ends: 33814 [2019-11-15 20:39:36,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33814 states. [2019-11-15 20:39:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33814 to 32434. [2019-11-15 20:39:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32434 states. [2019-11-15 20:39:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32434 states to 32434 states and 34027 transitions. [2019-11-15 20:39:37,121 INFO L78 Accepts]: Start accepts. Automaton has 32434 states and 34027 transitions. Word has length 1102 [2019-11-15 20:39:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:37,122 INFO L462 AbstractCegarLoop]: Abstraction has 32434 states and 34027 transitions. [2019-11-15 20:39:37,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:39:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32434 states and 34027 transitions. [2019-11-15 20:39:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2019-11-15 20:39:37,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:37,137 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 20:39:37,137 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1616622707, now seen corresponding path program 1 times [2019-11-15 20:39:37,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:37,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876508638] [2019-11-15 20:39:37,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:37,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:37,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 458 proven. 6 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-11-15 20:39:38,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876508638] [2019-11-15 20:39:38,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138630356] [2019-11-15 20:39:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:38,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:38,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-11-15 20:39:39,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:39:39,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-15 20:39:39,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431342394] [2019-11-15 20:39:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:39:39,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:39:39,908 INFO L87 Difference]: Start difference. First operand 32434 states and 34027 transitions. Second operand 3 states. [2019-11-15 20:39:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:42,039 INFO L93 Difference]: Finished difference Result 73146 states and 77037 transitions. [2019-11-15 20:39:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:42,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1107 [2019-11-15 20:39:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:42,067 INFO L225 Difference]: With dead ends: 73146 [2019-11-15 20:39:42,067 INFO L226 Difference]: Without dead ends: 41404 [2019-11-15 20:39:42,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:39:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2019-11-15 20:39:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 39334. [2019-11-15 20:39:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39334 states. [2019-11-15 20:39:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39334 states to 39334 states and 41399 transitions. [2019-11-15 20:39:42,447 INFO L78 Accepts]: Start accepts. Automaton has 39334 states and 41399 transitions. Word has length 1107 [2019-11-15 20:39:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:42,448 INFO L462 AbstractCegarLoop]: Abstraction has 39334 states and 41399 transitions. [2019-11-15 20:39:42,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:39:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 39334 states and 41399 transitions. [2019-11-15 20:39:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1122 [2019-11-15 20:39:42,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:42,463 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 20:39:42,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:42,669 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1394068458, now seen corresponding path program 1 times [2019-11-15 20:39:42,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:42,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333024900] [2019-11-15 20:39:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2019-11-15 20:39:43,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333024900] [2019-11-15 20:39:43,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:43,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:43,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466711699] [2019-11-15 20:39:43,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:39:43,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:43,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:43,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:43,807 INFO L87 Difference]: Start difference. First operand 39334 states and 41399 transitions. Second operand 4 states. [2019-11-15 20:39:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:47,025 INFO L93 Difference]: Finished difference Result 85566 states and 90207 transitions. [2019-11-15 20:39:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:47,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1121 [2019-11-15 20:39:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:47,067 INFO L225 Difference]: With dead ends: 85566 [2019-11-15 20:39:47,067 INFO L226 Difference]: Without dead ends: 46924 [2019-11-15 20:39:47,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2019-11-15 20:39:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46234. [2019-11-15 20:39:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46234 states. [2019-11-15 20:39:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 48521 transitions. [2019-11-15 20:39:47,587 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 48521 transitions. Word has length 1121 [2019-11-15 20:39:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:47,588 INFO L462 AbstractCegarLoop]: Abstraction has 46234 states and 48521 transitions. [2019-11-15 20:39:47,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:39:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 48521 transitions. [2019-11-15 20:39:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2019-11-15 20:39:47,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:47,604 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 20:39:47,604 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1670637858, now seen corresponding path program 1 times [2019-11-15 20:39:47,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:47,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816623203] [2019-11-15 20:39:47,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:47,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:47,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 463 proven. 795 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 20:39:50,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816623203] [2019-11-15 20:39:50,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384699624] [2019-11-15 20:39:50,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:50,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:51,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2019-11-15 20:39:51,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:39:51,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-11-15 20:39:51,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782641006] [2019-11-15 20:39:51,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:39:51,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:39:51,768 INFO L87 Difference]: Start difference. First operand 46234 states and 48521 transitions. Second operand 3 states. [2019-11-15 20:39:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:53,942 INFO L93 Difference]: Finished difference Result 107646 states and 113372 transitions. [2019-11-15 20:39:53,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:53,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1142 [2019-11-15 20:39:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:54,001 INFO L225 Difference]: With dead ends: 107646 [2019-11-15 20:39:54,001 INFO L226 Difference]: Without dead ends: 62104 [2019-11-15 20:39:54,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1142 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:39:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2019-11-15 20:39:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 62104. [2019-11-15 20:39:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62104 states. [2019-11-15 20:39:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62104 states to 62104 states and 64817 transitions. [2019-11-15 20:39:54,651 INFO L78 Accepts]: Start accepts. Automaton has 62104 states and 64817 transitions. Word has length 1142 [2019-11-15 20:39:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:39:54,652 INFO L462 AbstractCegarLoop]: Abstraction has 62104 states and 64817 transitions. [2019-11-15 20:39:54,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:39:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62104 states and 64817 transitions. [2019-11-15 20:39:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1239 [2019-11-15 20:39:54,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:39:54,669 INFO L380 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 20:39:54,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:54,872 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:39:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1815460078, now seen corresponding path program 1 times [2019-11-15 20:39:54,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:54,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878146339] [2019-11-15 20:39:54,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2019-11-15 20:39:56,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878146339] [2019-11-15 20:39:56,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:56,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:56,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675809806] [2019-11-15 20:39:56,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:39:56,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:56,013 INFO L87 Difference]: Start difference. First operand 62104 states and 64817 transitions. Second operand 4 states. [2019-11-15 20:39:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:59,138 INFO L93 Difference]: Finished difference Result 148356 states and 155480 transitions. [2019-11-15 20:39:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:59,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1238 [2019-11-15 20:39:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:39:59,204 INFO L225 Difference]: With dead ends: 148356 [2019-11-15 20:39:59,204 INFO L226 Difference]: Without dead ends: 82804 [2019-11-15 20:39:59,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82804 states. [2019-11-15 20:39:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82804 to 74524. [2019-11-15 20:39:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74524 states. [2019-11-15 20:40:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74524 states to 74524 states and 77401 transitions. [2019-11-15 20:40:00,041 INFO L78 Accepts]: Start accepts. Automaton has 74524 states and 77401 transitions. Word has length 1238 [2019-11-15 20:40:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:00,041 INFO L462 AbstractCegarLoop]: Abstraction has 74524 states and 77401 transitions. [2019-11-15 20:40:00,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:40:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 74524 states and 77401 transitions. [2019-11-15 20:40:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2019-11-15 20:40:00,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:40:00,055 INFO L380 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 20:40:00,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:40:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1941423907, now seen corresponding path program 1 times [2019-11-15 20:40:00,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:00,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550411414] [2019-11-15 20:40:00,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1783 backedges. 936 proven. 581 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-11-15 20:40:03,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550411414] [2019-11-15 20:40:03,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641510628] [2019-11-15 20:40:03,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/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-15 20:40:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:03,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:40:03,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1783 backedges. 1069 proven. 0 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-11-15 20:40:04,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:40:04,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-15 20:40:04,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229733174] [2019-11-15 20:40:04,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:40:04,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:04,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:04,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:40:04,535 INFO L87 Difference]: Start difference. First operand 74524 states and 77401 transitions. Second operand 3 states. [2019-11-15 20:40:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:06,556 INFO L93 Difference]: Finished difference Result 149736 states and 155513 transitions. [2019-11-15 20:40:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:06,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1239 [2019-11-15 20:40:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:40:06,612 INFO L225 Difference]: With dead ends: 149736 [2019-11-15 20:40:06,613 INFO L226 Difference]: Without dead ends: 75214 [2019-11-15 20:40:06,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1249 GetRequests, 1240 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:40:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75214 states. [2019-11-15 20:40:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75214 to 75214. [2019-11-15 20:40:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75214 states. [2019-11-15 20:40:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 77634 transitions. [2019-11-15 20:40:07,154 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 77634 transitions. Word has length 1239 [2019-11-15 20:40:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:07,155 INFO L462 AbstractCegarLoop]: Abstraction has 75214 states and 77634 transitions. [2019-11-15 20:40:07,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:40:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 77634 transitions. [2019-11-15 20:40:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2019-11-15 20:40:07,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:40:07,169 INFO L380 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, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 20:40:07,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:40:07,370 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:40:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash 21704526, now seen corresponding path program 1 times [2019-11-15 20:40:07,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:07,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069287571] [2019-11-15 20:40:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:07,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1829 backedges. 1113 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-11-15 20:40:08,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069287571] [2019-11-15 20:40:08,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:08,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:40:08,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408286891] [2019-11-15 20:40:08,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:40:08,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:40:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:40:08,853 INFO L87 Difference]: Start difference. First operand 75214 states and 77634 transitions. Second operand 4 states. [2019-11-15 20:40:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:12,037 INFO L93 Difference]: Finished difference Result 150426 states and 155279 transitions. [2019-11-15 20:40:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:40:12,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1244 [2019-11-15 20:40:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:40:12,093 INFO L225 Difference]: With dead ends: 150426 [2019-11-15 20:40:12,093 INFO L226 Difference]: Without dead ends: 75904 [2019-11-15 20:40:12,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:40:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75904 states. [2019-11-15 20:40:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75904 to 73834. [2019-11-15 20:40:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73834 states. [2019-11-15 20:40:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73834 states to 73834 states and 75696 transitions. [2019-11-15 20:40:12,635 INFO L78 Accepts]: Start accepts. Automaton has 73834 states and 75696 transitions. Word has length 1244 [2019-11-15 20:40:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:12,635 INFO L462 AbstractCegarLoop]: Abstraction has 73834 states and 75696 transitions. [2019-11-15 20:40:12,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:40:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 73834 states and 75696 transitions. [2019-11-15 20:40:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1284 [2019-11-15 20:40:12,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:40:12,649 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:12,650 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:40:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2117417726, now seen corresponding path program 1 times [2019-11-15 20:40:12,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:12,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953171399] [2019-11-15 20:40:12,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:12,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:12,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 1187 trivial. 0 not checked. [2019-11-15 20:40:14,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953171399] [2019-11-15 20:40:14,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:14,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:14,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931474816] [2019-11-15 20:40:14,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:40:14,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:14,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:14,492 INFO L87 Difference]: Start difference. First operand 73834 states and 75696 transitions. Second operand 3 states. [2019-11-15 20:40:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:16,522 INFO L93 Difference]: Finished difference Result 146976 states and 150699 transitions. [2019-11-15 20:40:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:16,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1283 [2019-11-15 20:40:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:40:16,585 INFO L225 Difference]: With dead ends: 146976 [2019-11-15 20:40:16,585 INFO L226 Difference]: Without dead ends: 73834 [2019-11-15 20:40:16,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73834 states. [2019-11-15 20:40:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73834 to 73834. [2019-11-15 20:40:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73834 states. [2019-11-15 20:40:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73834 states to 73834 states and 75542 transitions. [2019-11-15 20:40:17,191 INFO L78 Accepts]: Start accepts. Automaton has 73834 states and 75542 transitions. Word has length 1283 [2019-11-15 20:40:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:17,192 INFO L462 AbstractCegarLoop]: Abstraction has 73834 states and 75542 transitions. [2019-11-15 20:40:17,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:40:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 73834 states and 75542 transitions. [2019-11-15 20:40:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1569 [2019-11-15 20:40:17,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:40:17,221 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:17,222 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:40:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 498975874, now seen corresponding path program 1 times [2019-11-15 20:40:17,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:17,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807797260] [2019-11-15 20:40:17,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:17,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:17,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3372 backedges. 2175 proven. 515 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2019-11-15 20:40:19,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807797260] [2019-11-15 20:40:19,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969997092] [2019-11-15 20:40:19,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/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-15 20:40:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:19,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1831 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:40:19,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:19,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3372 backedges. 2221 proven. 0 refuted. 0 times theorem prover too weak. 1151 trivial. 0 not checked. [2019-11-15 20:40:22,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:40:22,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-15 20:40:22,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10685563] [2019-11-15 20:40:22,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:40:22,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:22,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:40:22,933 INFO L87 Difference]: Start difference. First operand 73834 states and 75542 transitions. Second operand 3 states. [2019-11-15 20:40:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:26,070 INFO L93 Difference]: Finished difference Result 165606 states and 169673 transitions. [2019-11-15 20:40:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:26,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1568 [2019-11-15 20:40:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:40:26,147 INFO L225 Difference]: With dead ends: 165606 [2019-11-15 20:40:26,147 INFO L226 Difference]: Without dead ends: 92464 [2019-11-15 20:40:26,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1575 GetRequests, 1569 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:40:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92464 states. [2019-11-15 20:40:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92464 to 91774. [2019-11-15 20:40:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91774 states. [2019-11-15 20:40:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91774 states to 91774 states and 94000 transitions. [2019-11-15 20:40:26,893 INFO L78 Accepts]: Start accepts. Automaton has 91774 states and 94000 transitions. Word has length 1568 [2019-11-15 20:40:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:26,894 INFO L462 AbstractCegarLoop]: Abstraction has 91774 states and 94000 transitions. [2019-11-15 20:40:26,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:40:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 91774 states and 94000 transitions. [2019-11-15 20:40:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2019-11-15 20:40:26,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:40:26,922 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:27,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:40:27,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:40:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1775350542, now seen corresponding path program 1 times [2019-11-15 20:40:27,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:27,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689355821] [2019-11-15 20:40:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2672 backedges. 1723 proven. 314 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2019-11-15 20:40:29,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689355821] [2019-11-15 20:40:29,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376173739] [2019-11-15 20:40:29,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/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-15 20:40:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:40:29,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:29,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:40:29,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2672 backedges. 765 proven. 45 refuted. 0 times theorem prover too weak. 1862 trivial. 0 not checked. [2019-11-15 20:40:33,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:40:33,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 20:40:33,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430902613] [2019-11-15 20:40:33,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:40:33,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:40:33,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:40:33,227 INFO L87 Difference]: Start difference. First operand 91774 states and 94000 transitions. Second operand 7 states. [2019-11-15 20:40:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:49,127 INFO L93 Difference]: Finished difference Result 213214 states and 218630 transitions. [2019-11-15 20:40:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:40:49,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1576 [2019-11-15 20:40:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:40:49,128 INFO L225 Difference]: With dead ends: 213214 [2019-11-15 20:40:49,128 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:40:49,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1589 GetRequests, 1580 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:40:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:40:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:40:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:40:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:40:49,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1576 [2019-11-15 20:40:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:40:49,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:49,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:40:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:40:49,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:40:49,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:40:49,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:40:49,961 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 244 [2019-11-15 20:40:50,402 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 244 [2019-11-15 20:40:50,750 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 244 [2019-11-15 20:40:51,033 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 244 [2019-11-15 20:40:52,733 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 238 DAG size of output: 100 [2019-11-15 20:40:54,322 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 238 DAG size of output: 100 [2019-11-15 20:40:55,919 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 238 DAG size of output: 100 [2019-11-15 20:40:57,492 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 238 DAG size of output: 100 [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L2876(lines 2876 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L3933(lines 3933 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L2480(lines 2480 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L4066(lines 4066 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L1952(lines 1952 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L2349(lines 2349 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L896(lines 896 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L1557(lines 1557 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L1425(lines 1425 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,496 INFO L443 ceAbstractionStarter]: For program point L3407(lines 3407 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3275(lines 3275 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3011(lines 3011 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3804(lines 3804 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L2747(lines 2747 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L4201(lines 4201 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L2087(lines 2087 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L766(lines 766 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3541(lines 3541 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L2220(lines 2220 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L1163(lines 1163 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3145(lines 3145 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,497 INFO L443 ceAbstractionStarter]: For program point L3674(lines 3674 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L2617(lines 2617 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L4071(lines 4071 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L2882(lines 2882 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L3939(lines 3939 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L2487(lines 2487 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,498 INFO L443 ceAbstractionStarter]: For program point L1959(lines 1959 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L1563(lines 1563 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L2356(lines 2356 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L3413(lines 3413 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L3282(lines 3282 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L3018(lines 3018 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L2754(lines 2754 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L3811(lines 3811 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L3547(lines 3547 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L2226(lines 2226 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L1169(lines 1169 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L2094(lines 2094 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L4208(lines 4208 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L4076(lines 4076 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L1830(lines 1830 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,499 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3152(lines 3152 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L2624(lines 2624 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3681(lines 3681 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3946(lines 3946 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L2889(lines 2889 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L2493(lines 2493 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L1304(lines 1304 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L1569(lines 1569 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3419(lines 3419 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L1966(lines 1966 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3023(lines 3023 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L2363(lines 2363 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,500 INFO L443 ceAbstractionStarter]: For program point L3288(lines 3288 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L1835(lines 1835 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2760(lines 2760 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L3553(lines 3553 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L3157(lines 3157 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L3818(lines 3818 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L4215(lines 4215 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2233(lines 2233 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L4083(lines 4083 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2630(lines 2630 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2498(lines 2498 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L1045(lines 1045 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L2895(lines 2895 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,501 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3688(lines 3688 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L1971(lines 1971 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3953(lines 3953 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3425(lines 3425 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L1576(lines 1576 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3294(lines 3294 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3030(lines 3030 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L1841(lines 1841 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L2766(lines 2766 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L2370(lines 2370 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3824(lines 3824 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3560(lines 3560 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L2239(lines 2239 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,502 INFO L443 ceAbstractionStarter]: For program point L3164(lines 3164 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L2636(lines 2636 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L2504(lines 2504 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L4222(lines 4222 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L2108(lines 2108 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L4090(lines 4090 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L2901(lines 2901 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L1712(lines 1712 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,503 INFO L443 ceAbstractionStarter]: For program point L3695(lines 3695 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L1978(lines 1978 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L3960(lines 3960 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L3432(lines 3432 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L1847(lines 1847 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L2772(lines 2772 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,504 INFO L443 ceAbstractionStarter]: For program point L2376(lines 2376 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L3301(lines 3301 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L3037(lines 3037 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L3830(lines 3830 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L2510(lines 2510 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L3567(lines 3567 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L2114(lines 2114 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,505 INFO L443 ceAbstractionStarter]: For program point L3171(lines 3171 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L4096(lines 4096 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L1718(lines 1718 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L2643(lines 2643 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L4229(lines 4229 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L1058(lines 1058 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L2908(lines 2908 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L1323(lines 1323 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L3966(lines 3966 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L3702(lines 3702 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L1588(lines 1588 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,506 INFO L443 ceAbstractionStarter]: For program point L3438(lines 3438 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L3042(lines 3042 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L1985(lines 1985 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L928(lines 928 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L3835(lines 3835 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L2382(lines 2382 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L1854(lines 1854 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L2779(lines 2779 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L3308(lines 3308 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L2251(lines 2251 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L2516(lines 2516 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L3573(lines 3573 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L1459(lines 1459 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,507 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L3177(lines 3177 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L2649(lines 2649 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L2121(lines 2121 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L4103(lines 4103 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L1725(lines 1725 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L4236(lines 4236 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L1990(lines 1990 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L2915(lines 2915 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L3444(lines 3444 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L1330(lines 1330 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L2387(lines 2387 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,508 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L3973(lines 3973 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L3709(lines 3709 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L1860(lines 1860 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L3842(lines 3842 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,509 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,510 INFO L439 ceAbstractionStarter]: At program point L3050(lines 1640 3051) the Hoare annotation is: (let ((.cse10 (<= ~a15~0 4)) (.cse5 (not (= ~a24~0 0))) (.cse7 (= ~a18~0 9)) (.cse19 (= 8 ~a18~0)) (.cse11 (= ~a24~0 3))) (let ((.cse0 (not .cse11)) (.cse16 (= ~a24~0 2)) (.cse12 (<= ~a3~0 417)) (.cse9 (not .cse19)) (.cse8 (not .cse7)) (.cse15 (<= ~a24~0 3)) (.cse4 (<= ~a24~0 1)) (.cse18 (< 417 ~a3~0)) (.cse13 (not (= ~a15~0 4))) (.cse3 (= 10 ~a18~0)) (.cse2 (or (and (not (= ~a18~0 11)) .cse10) (and .cse10 .cse5))) (.cse1 (exists ((v_~a3~0_1865 Int)) (and (<= 0 (* 4 v_~a3~0_1865)) (<= (+ (div (* v_~a3~0_1865 4) 10) 67) ~a3~0) (< 306 v_~a3~0_1865)))) (.cse14 (<= ~a3~0 306)) (.cse6 (<= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse4) (and .cse6 .cse4 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse3) .cse0 .cse8 .cse2) (and .cse8 .cse13 .cse14 .cse4) (and .cse13 .cse15 .cse6) (and .cse13 .cse16) (and .cse9 .cse8 .cse13 .cse6) (and (exists ((v_prenex_9 Int)) (let ((.cse17 (mod (+ (* (mod v_prenex_9 55) 5) 50) 55))) (and (< 417 v_prenex_9) (<= (+ .cse17 348) ~a3~0) (= 0 .cse17) (<= 0 v_prenex_9)))) .cse6 .cse4) (and .cse9 .cse14 .cse11 .cse6) (and .cse18 (<= ~a24~0 0)) (and (= 12 ~a18~0) .cse14 .cse15) (and .cse16 .cse7) (and .cse9 .cse13 .cse18 .cse15) (and .cse13 .cse19 .cse12 .cse5 .cse15) (and .cse9 .cse8 .cse13 .cse4) (and .cse13 .cse5 .cse15 .cse7) (and .cse1 .cse4 .cse7) (and .cse18 .cse19 .cse10) (and .cse1 .cse13 .cse19 .cse6 (<= ~a3~0 414)) (and .cse3 .cse11) (and .cse3 (<= ~a3~0 115) .cse2) (and .cse1 .cse19 .cse14 .cse6)))) [2019-11-15 20:40:57,510 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,510 INFO L443 ceAbstractionStarter]: For program point L2786(lines 2786 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,510 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L3579(lines 3579 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L1465(lines 1465 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L2258(lines 2258 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L3315(lines 3315 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 20:40:57,511 INFO L443 ceAbstractionStarter]: For program point L3183(lines 3183 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L1730(lines 1730 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L2655(lines 2655 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L4109(lines 4109 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,512 INFO L443 ceAbstractionStarter]: For program point L2128(lines 2128 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L1996(lines 1996 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L2921(lines 2921 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L2393(lines 2393 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L4243(lines 4243 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L1072(lines 1072 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,513 INFO L443 ceAbstractionStarter]: For program point L3979(lines 3979 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L676(lines 676 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L3451(lines 3451 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L941(lines 941 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L1866(lines 1866 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L3848(lines 3848 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L3716(lines 3716 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,514 INFO L443 ceAbstractionStarter]: For program point L3584(lines 3584 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L413(lines 413 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L3056(lines 3056 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L2792(lines 2792 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L2264(lines 2264 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,515 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L3189(lines 3189 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L2661(lines 2661 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L3322(lines 3322 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,516 INFO L443 ceAbstractionStarter]: For program point L1737(lines 1737 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L4116(lines 4116 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L2927(lines 2927 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L2003(lines 2003 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L3985(lines 3985 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,517 INFO L443 ceAbstractionStarter]: For program point L1343(lines 1343 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L439 ceAbstractionStarter]: At program point L4250(lines 3053 4251) the Hoare annotation is: (let ((.cse10 (<= ~a15~0 4)) (.cse3 (not (= ~a24~0 0))) (.cse7 (= ~a18~0 9)) (.cse19 (= 8 ~a18~0)) (.cse11 (= ~a24~0 3))) (let ((.cse0 (not .cse11)) (.cse16 (= ~a24~0 2)) (.cse12 (<= ~a3~0 417)) (.cse9 (not .cse19)) (.cse8 (not .cse7)) (.cse15 (<= ~a24~0 3)) (.cse4 (<= ~a24~0 1)) (.cse18 (< 417 ~a3~0)) (.cse13 (not (= ~a15~0 4))) (.cse5 (= 10 ~a18~0)) (.cse2 (or (and (not (= ~a18~0 11)) .cse10) (and .cse10 .cse3))) (.cse1 (exists ((v_~a3~0_1865 Int)) (and (<= 0 (* 4 v_~a3~0_1865)) (<= (+ (div (* v_~a3~0_1865 4) 10) 67) ~a3~0) (< 306 v_~a3~0_1865)))) (.cse14 (<= ~a3~0 306)) (.cse6 (<= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse4) (and .cse6 .cse4 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse5) .cse0 .cse8 .cse2) (and .cse8 .cse13 .cse14 .cse4) (and .cse13 .cse15 .cse6) (and .cse13 .cse16) (and .cse9 .cse8 .cse13 .cse6) (and (exists ((v_prenex_9 Int)) (let ((.cse17 (mod (+ (* (mod v_prenex_9 55) 5) 50) 55))) (and (< 417 v_prenex_9) (<= (+ .cse17 348) ~a3~0) (= 0 .cse17) (<= 0 v_prenex_9)))) .cse6 .cse4) (and .cse9 .cse14 .cse11 .cse6) (and .cse18 (<= ~a24~0 0)) (and (= 12 ~a18~0) .cse14 .cse15) (and .cse16 .cse7) (and .cse9 .cse13 .cse18 .cse15) (and .cse13 .cse19 .cse12 .cse3 .cse15) (and .cse9 .cse8 .cse13 .cse4) (and .cse13 .cse3 .cse15 .cse7) (and .cse1 .cse4 .cse7) (and .cse18 .cse19 .cse10) (and .cse1 .cse13 .cse19 .cse6 (<= ~a3~0 414)) (and .cse5 .cse11) (and .cse5 (<= ~a3~0 115) .cse2) (and .cse1 .cse19 .cse14 .cse6)))) [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L3854(lines 3854 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L3458(lines 3458 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L1873(lines 1873 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L3723(lines 3723 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L2534(lines 2534 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L3591(lines 3591 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 20:40:57,518 INFO L443 ceAbstractionStarter]: For program point L3063(lines 3063 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L2667(lines 2667 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L2271(lines 2271 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L3196(lines 3196 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L446 ceAbstractionStarter]: At program point L4253(lines 4253 4269) the Hoare annotation is: true [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L2932(lines 2932 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L818(lines 818 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L1479(lines 1479 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L3329(lines 3329 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L4122(lines 4122 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L26-2(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L1744(lines 1744 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,519 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L1084(lines 1084 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L2141(lines 2141 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L3991(lines 3991 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L2406(lines 2406 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1217 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L2010(lines 2010 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L689(lines 689 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L3464(lines 3464 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L1879(lines 1879 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L3861(lines 3861 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,520 INFO L443 ceAbstractionStarter]: For program point L2540(lines 2540 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L3597(lines 3597 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L2805(lines 2805 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L3730(lines 3730 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L1352(lines 1352 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L2277(lines 2277 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L3070(lines 3070 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,521 INFO L439 ceAbstractionStarter]: At program point L4259-2(lines 4259 4268) the Hoare annotation is: (let ((.cse10 (<= ~a15~0 4)) (.cse5 (not (= ~a24~0 0))) (.cse7 (= ~a18~0 9)) (.cse19 (= 8 ~a18~0)) (.cse11 (= ~a24~0 3))) (let ((.cse0 (not .cse11)) (.cse16 (= ~a24~0 2)) (.cse12 (<= ~a3~0 417)) (.cse9 (not .cse19)) (.cse8 (not .cse7)) (.cse15 (<= ~a24~0 3)) (.cse4 (<= ~a24~0 1)) (.cse18 (< 417 ~a3~0)) (.cse13 (not (= ~a15~0 4))) (.cse3 (= 10 ~a18~0)) (.cse2 (or (and (not (= ~a18~0 11)) .cse10) (and .cse10 .cse5))) (.cse1 (exists ((v_~a3~0_1865 Int)) (and (<= 0 (* 4 v_~a3~0_1865)) (<= (+ (div (* v_~a3~0_1865 4) 10) 67) ~a3~0) (< 306 v_~a3~0_1865)))) (.cse14 (<= ~a3~0 306)) (.cse6 (<= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse4) (and .cse6 .cse4 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse3) .cse0 .cse8 .cse2) (and .cse8 .cse13 .cse14 .cse4) (and .cse13 .cse15 .cse6) (and .cse13 .cse16) (and .cse9 .cse8 .cse13 .cse6) (and (exists ((v_prenex_9 Int)) (let ((.cse17 (mod (+ (* (mod v_prenex_9 55) 5) 50) 55))) (and (< 417 v_prenex_9) (<= (+ .cse17 348) ~a3~0) (= 0 .cse17) (<= 0 v_prenex_9)))) .cse6 .cse4) (and .cse9 .cse14 .cse11 .cse6) (and .cse18 (<= ~a24~0 0)) (and (= 12 ~a18~0) .cse14 .cse15) (and .cse16 .cse7) (and .cse9 .cse13 .cse18 .cse15) (and .cse13 .cse19 .cse12 .cse5 .cse15) (and .cse9 .cse8 .cse13 .cse4) (and .cse13 .cse5 .cse15 .cse7) (and .cse1 .cse4 .cse7) (and .cse18 .cse19 .cse10) (and .cse1 .cse13 .cse19 .cse6 (<= ~a3~0 414)) (and .cse3 .cse11) (and .cse3 (<= ~a3~0 115) .cse2) (and .cse1 .cse19 .cse14 .cse6)))) [2019-11-15 20:40:57,521 INFO L443 ceAbstractionStarter]: For program point L2674(lines 2674 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L3203(lines 3203 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L2939(lines 2939 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L1750(lines 1750 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L1486(lines 1486 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L3336(lines 3336 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L4129(lines 4129 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L2148(lines 2148 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,522 INFO L443 ceAbstractionStarter]: For program point L2016(lines 2016 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L3998(lines 3998 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L1884(lines 1884 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L3602(lines 3602 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L2413(lines 2413 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L960(lines 960 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L3867(lines 3867 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L2546(lines 2546 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L3471(lines 3471 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,523 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L4264(line 4264) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L2811(lines 2811 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L3076(lines 3076 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L3737(lines 3737 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,524 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L2284(lines 2284 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L2945(lines 2945 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1756 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L2681(lines 2681 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,525 INFO L443 ceAbstractionStarter]: For program point L3342(lines 3342 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L3210(lines 3210 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L1493(lines 1493 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L4136(lines 4136 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L2022(lines 2022 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L3608(lines 3608 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L2155(lines 2155 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,526 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L4005(lines 4005 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L1891(lines 1891 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L3873(lines 3873 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L2420(lines 2420 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L3477(lines 3477 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L2817(lines 2817 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L3082(lines 3082 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L3743(lines 3743 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L2290(lines 2290 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,527 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L1762(lines 1762 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L2687(lines 2687 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L2952(lines 2952 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L838(lines 838 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L3349(lines 3349 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L3217(lines 3217 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L4010(lines 4010 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L3614(lines 3614 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,528 INFO L443 ceAbstractionStarter]: For program point L2161(lines 2161 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L4143(lines 4143 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L2029(lines 2029 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L2558(lines 2558 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L2426(lines 2426 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L1898(lines 1898 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L3880(lines 3880 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L3484(lines 3484 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L2824(lines 2824 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L1767(lines 1767 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,529 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L3089(lines 3089 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L3750(lines 3750 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L2693(lines 2693 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L1372(lines 1372 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L3222(lines 3222 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,530 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 20:40:57,531 INFO L443 ceAbstractionStarter]: For program point L2958(lines 2958 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,531 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,531 INFO L439 ceAbstractionStarter]: At program point L1637(lines 25 1638) the Hoare annotation is: (let ((.cse10 (<= ~a15~0 4)) (.cse3 (not (= ~a24~0 0))) (.cse7 (= ~a18~0 9)) (.cse19 (= 8 ~a18~0)) (.cse11 (= ~a24~0 3))) (let ((.cse0 (not .cse11)) (.cse16 (= ~a24~0 2)) (.cse12 (<= ~a3~0 417)) (.cse9 (not .cse19)) (.cse8 (not .cse7)) (.cse15 (<= ~a24~0 3)) (.cse4 (<= ~a24~0 1)) (.cse18 (< 417 ~a3~0)) (.cse13 (not (= ~a15~0 4))) (.cse5 (= 10 ~a18~0)) (.cse2 (or (and (not (= ~a18~0 11)) .cse10) (and .cse10 .cse3))) (.cse1 (exists ((v_~a3~0_1865 Int)) (and (<= 0 (* 4 v_~a3~0_1865)) (<= (+ (div (* v_~a3~0_1865 4) 10) 67) ~a3~0) (< 306 v_~a3~0_1865)))) (.cse14 (<= ~a3~0 306)) (.cse6 (<= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse4) (and .cse6 .cse4 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse5) .cse0 .cse8 .cse2) (and .cse8 .cse13 .cse14 .cse4) (and .cse13 .cse15 .cse6) (and .cse13 .cse16) (and .cse9 .cse8 .cse13 .cse6) (and (exists ((v_prenex_9 Int)) (let ((.cse17 (mod (+ (* (mod v_prenex_9 55) 5) 50) 55))) (and (< 417 v_prenex_9) (<= (+ .cse17 348) ~a3~0) (= 0 .cse17) (<= 0 v_prenex_9)))) .cse6 .cse4) (and .cse9 .cse14 .cse11 .cse6) (and .cse18 (<= ~a24~0 0)) (and (= 12 ~a18~0) .cse14 .cse15) (and .cse16 .cse7) (and .cse9 .cse13 .cse18 .cse15) (and .cse13 .cse19 .cse12 .cse3 .cse15) (and .cse9 .cse8 .cse13 .cse4) (and .cse13 .cse3 .cse15 .cse7) (and .cse1 .cse4 .cse7) (and .cse18 .cse19 .cse10) (and .cse1 .cse13 .cse19 .cse6 (<= ~a3~0 414)) (and .cse5 .cse11) (and .cse5 (<= ~a3~0 115) .cse2) (and .cse1 .cse19 .cse14 .cse6)))) [2019-11-15 20:40:57,531 INFO L443 ceAbstractionStarter]: For program point L3355(lines 3355 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,531 INFO L443 ceAbstractionStarter]: For program point L4016(lines 4016 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L3621(lines 3621 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L1507(lines 1507 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,532 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L2168(lines 2168 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L1111(lines 1111 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L2036(lines 2036 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L3886(lines 3886 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L1772(lines 1772 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,533 INFO L443 ceAbstractionStarter]: For program point L2565(lines 2565 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L2433(lines 2433 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L1244(lines 1244 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L980(lines 980 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L3491(lines 3491 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,534 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L2831(lines 2831 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L3096(lines 3096 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L850(lines 850 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,535 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L2700(lines 2700 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L3757(lines 3757 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L1643(lines 1643 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L1379(lines 1379 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L2304(lines 2304 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L3229(lines 3229 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,536 INFO L443 ceAbstractionStarter]: For program point L4022(lines 4022 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L2965(lines 2965 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L1512(lines 1512 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L3362(lines 3362 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L3627(lines 3627 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,537 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L4156(lines 4156 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L2042(lines 2042 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L1778(lines 1778 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L2571(lines 2571 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,538 INFO L443 ceAbstractionStarter]: For program point L1118(lines 1118 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L2175(lines 2175 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L3893(lines 3893 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,539 INFO L443 ceAbstractionStarter]: For program point L1912(lines 1912 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L2837(lines 2837 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L1648(lines 1648 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L3498(lines 3498 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L3235(lines 3235 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,540 INFO L443 ceAbstractionStarter]: For program point L3103(lines 3103 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L4028(lines 4028 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L3764(lines 3764 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L2707(lines 2707 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L1518(lines 1518 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,541 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L3368(lines 3368 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L2311(lines 2311 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L2972(lines 2972 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L3633(lines 3633 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 20:40:57,542 INFO L443 ceAbstractionStarter]: For program point L4162(lines 4162 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L2048(lines 2048 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L1124(lines 1124 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L2181(lines 2181 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,543 INFO L443 ceAbstractionStarter]: For program point L3899(lines 3899 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L2578(lines 2578 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L2843(lines 2843 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,544 INFO L443 ceAbstractionStarter]: For program point L3504(lines 3504 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L3108(lines 3108 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L1919(lines 1919 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L1655(lines 1655 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L1523(lines 1523 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,545 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L2977(lines 2977 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2713 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L2317(lines 2317 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L3242(lines 3242 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,546 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L4035(lines 4035 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L3771(lines 3771 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L3375(lines 3375 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 20:40:57,547 INFO L443 ceAbstractionStarter]: For program point L2054(lines 2054 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L3640(lines 3640 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L2187(lines 2187 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L4169(lines 4169 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L1791(lines 1791 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L2584(lines 2584 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L1263(lines 1263 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,548 INFO L443 ceAbstractionStarter]: For program point L206-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L3113(lines 3113 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L3906(lines 3906 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L3510(lines 3510 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L2453(lines 2453 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,549 INFO L443 ceAbstractionStarter]: For program point L207(line 207) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L2850(lines 2850 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L1529(lines 1529 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L1926(lines 1926 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L2983(lines 2983 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L1662(lines 1662 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,550 INFO L443 ceAbstractionStarter]: For program point L2719(lines 2719 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L4041(lines 4041 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L870(lines 870 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L1399(lines 1399 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L2324(lines 2324 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L3249(lines 3249 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,551 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L1796(lines 1796 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L3778(lines 3778 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L3646(lines 3646 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L3382(lines 3382 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,552 INFO L443 ceAbstractionStarter]: For program point L2193(lines 2193 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L4175(lines 4175 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L2061(lines 2061 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L2590(lines 2590 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L1270(lines 1270 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L1138(lines 1138 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,553 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L3120(lines 3120 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L2988(lines 2988 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L2856(lines 2856 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L3913(lines 3913 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L3517(lines 3517 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,554 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L1536(lines 1536 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L2726(lines 2726 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,555 INFO L443 ceAbstractionStarter]: For program point L1405(lines 1405 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L3255(lines 3255 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L4048(lines 4048 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L877(lines 877 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L3784(lines 3784 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L3388(lines 3388 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,556 INFO L443 ceAbstractionStarter]: For program point L2331(lines 2331 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L2067(lines 2067 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L1803(lines 1803 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L3653(lines 3653 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L2200(lines 2200 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L4182(lines 4182 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,557 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L3126(lines 3126 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L2994(lines 2994 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L2862(lines 2862 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L3523(lines 3523 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,558 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L1938(lines 1938 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L3920(lines 3920 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,559 INFO L443 ceAbstractionStarter]: For program point L1543(lines 1543 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L883(lines 883 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L1676(lines 1676 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L2733(lines 2733 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L1412(lines 1412 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,560 INFO L443 ceAbstractionStarter]: For program point L3394(lines 3394 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L2337(lines 2337 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L3262(lines 3262 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L4055(lines 4055 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L3791(lines 3791 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L4188(lines 4188 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,561 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L3660(lines 3660 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L2603(lines 2603 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L2207(lines 2207 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L3529(lines 3529 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,562 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L3133(lines 3133 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L3001(lines 3001 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L2869(lines 2869 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L755(lines 755 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,563 INFO L443 ceAbstractionStarter]: For program point L1945(lines 1945 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L3927(lines 3927 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L1681(lines 1681 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L2474(lines 2474 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,564 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L3400(lines 3400 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L3004(lines 3004 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L4061(lines 4061 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L2740(lines 2740 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L3797(lines 3797 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,565 INFO L443 ceAbstractionStarter]: For program point L2344(lines 2344 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L3269(lines 3269 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L2080(lines 2080 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,566 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L4195(lines 4195 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L1817(lines 1817 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L2610(lines 2610 3049) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L3667(lines 3667 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L3535(lines 3535 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L3139(lines 3139 4249) no Hoare annotation was computed. [2019-11-15 20:40:57,567 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,568 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,568 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 25 1638) no Hoare annotation was computed. [2019-11-15 20:40:57,568 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1636) no Hoare annotation was computed. [2019-11-15 20:40:57,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:57,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:57,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:40:57 BoogieIcfgContainer [2019-11-15 20:40:57,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:40:57,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:40:57,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:40:57,633 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:40:57,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:38:54" (3/4) ... [2019-11-15 20:40:57,637 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:40:57,681 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 20:40:57,688 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:40:57,720 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (10 == a18 && a24 <= 1)) || (!(a24 == 0) && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) [2019-11-15 20:40:57,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (!(a24 == 0) && a24 <= 1)) || (10 == a18 && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) [2019-11-15 20:40:57,734 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (10 == a18 && a24 <= 1)) || (!(a24 == 0) && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) [2019-11-15 20:40:57,741 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (!(a24 == 0) && a24 <= 1)) || (10 == a18 && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) [2019-11-15 20:40:58,099 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9d2bc070-a382-48bc-a4ac-7c6310c4b984/bin/uautomizer/witness.graphml [2019-11-15 20:40:58,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:40:58,100 INFO L168 Benchmark]: Toolchain (without parser) took 130100.31 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 934.0 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,101 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:58,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1626.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 233.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 974.4 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,102 INFO L168 Benchmark]: Boogie Preprocessor took 184.84 ms. Allocated memory is still 1.2 GB. Free memory was 974.4 MB in the beginning and 946.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,102 INFO L168 Benchmark]: RCFGBuilder took 3961.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 946.3 MB in the beginning and 863.2 MB in the end (delta: 83.1 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,102 INFO L168 Benchmark]: TraceAbstraction took 123623.31 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.1 GB). Free memory was 863.2 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,103 INFO L168 Benchmark]: Witness Printer took 466.16 ms. Allocated memory is still 5.4 GB. Free memory was 4.4 GB in the beginning and 4.2 GB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:58,105 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.24 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 1626.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 233.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 974.4 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.84 ms. Allocated memory is still 1.2 GB. Free memory was 974.4 MB in the beginning and 946.3 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3961.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 946.3 MB in the beginning and 863.2 MB in the end (delta: 83.1 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 123623.31 ms. Allocated memory was 1.3 GB in the beginning and 5.4 GB in the end (delta: 4.1 GB). Free memory was 863.2 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 466.16 ms. Allocated memory is still 5.4 GB. Free memory was 4.4 GB in the beginning and 4.2 GB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 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_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 4253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3053]: Loop Invariant [2019-11-15 20:40:58,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (!(a24 == 0) && a24 <= 1)) || (10 == a18 && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) - InvariantResult [Line: 25]: Loop Invariant [2019-11-15 20:40:58,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (!(a24 == 0) && a24 <= 1)) || (10 == a18 && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) - InvariantResult [Line: 4259]: Loop Invariant [2019-11-15 20:40:58,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (10 == a18 && a24 <= 1)) || (!(a24 == 0) && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) - InvariantResult [Line: 1640]: Loop Invariant [2019-11-15 20:40:58,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-11-15 20:40:58,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] [2019-11-15 20:40:58,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a3~0_1865,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((!(a24 == 3) && (\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0)))) || (10 == a18 && a24 <= 1)) || (!(a24 == 0) && a24 <= 1)) || ((a15 <= 5 && a24 <= 1) && a18 == 9)) || ((((!(a18 == 9) && !(8 == a18)) && a15 <= 4) && a24 == 3) && a3 <= 417)) || (((!(10 == a18) && !(a24 == 3)) && !(a18 == 9)) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || (((!(a18 == 9) && !(a15 == 4)) && a3 <= 306) && a24 <= 1)) || ((!(a15 == 4) && a24 <= 3) && a15 <= 5)) || (!(a15 == 4) && a24 == 2)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a15 <= 5)) || (((\exists v_prenex_9 : int :: ((417 < v_prenex_9 && (v_prenex_9 % 55 * 5 + 50) % 55 + 348 <= a3) && 0 == (v_prenex_9 % 55 * 5 + 50) % 55) && 0 <= v_prenex_9) && a15 <= 5) && a24 <= 1)) || (((!(8 == a18) && a3 <= 306) && a24 == 3) && a15 <= 5)) || (417 < a3 && a24 <= 0)) || ((12 == a18 && a3 <= 306) && a24 <= 3)) || (a24 == 2 && a18 == 9)) || (((!(8 == a18) && !(a15 == 4)) && 417 < a3) && a24 <= 3)) || ((((!(a15 == 4) && 8 == a18) && a3 <= 417) && !(a24 == 0)) && a24 <= 3)) || (((!(8 == a18) && !(a18 == 9)) && !(a15 == 4)) && a24 <= 1)) || (((!(a15 == 4) && !(a24 == 0)) && a24 <= 3) && a18 == 9)) || (((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && a24 <= 1) && a18 == 9)) || ((417 < a3 && 8 == a18) && a15 <= 4)) || (((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && !(a15 == 4)) && 8 == a18) && a15 <= 5) && a3 <= 414)) || (10 == a18 && a24 == 3)) || ((10 == a18 && a3 <= 115) && ((!(a18 == 11) && a15 <= 4) || (a15 <= 4 && !(a24 == 0))))) || ((((\exists v_~a3~0_1865 : int :: (0 <= 4 * v_~a3~0_1865 && v_~a3~0_1865 * 4 / 10 + 67 <= a3) && 306 < v_~a3~0_1865) && 8 == a18) && a3 <= 306) && a15 <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Result: SAFE, OverallTime: 123.4s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 71.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, HoareTripleCheckerStatistics: 9543 SDtfs, 22995 SDslu, 289 SDs, 0 SdLazy, 67424 SolverSat, 10274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7936 GetRequests, 7844 SyntacticMatches, 21 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91774occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 26910 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 760 NumberOfFragments, 1741 HoareAnnotationTreeSize, 5 FomulaSimplifications, 30100 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 5 FomulaSimplificationsInter, 26508 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 23136 NumberOfCodeBlocks, 23136 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 23111 ConstructedInterpolants, 275 QuantifiedInterpolants, 65408542 SizeOfPredicates, 1 NumberOfNonLiveVariables, 9237 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 29619/31884 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...