./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:26:35,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:26:35,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:26:35,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:26:35,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:26:35,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:26:35,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:26:35,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:26:35,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:26:35,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:26:35,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:26:35,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:26:35,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:26:35,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:26:35,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:26:35,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:26:35,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:26:35,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:26:35,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:26:35,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:26:35,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:26:35,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:26:35,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:26:35,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:26:35,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:26:35,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:26:35,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:26:35,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:26:35,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:26:35,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:26:35,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:26:35,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:26:35,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:26:35,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:26:35,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:26:35,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:26:35,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:26:35,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:26:35,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:26:35,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:26:35,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:26:35,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:26:35,312 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:26:35,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:26:35,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:26:35,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:26:35,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:26:35,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:26:35,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:26:35,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:26:35,316 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:26:35,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:26:35,317 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:26:35,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:26:35,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:26:35,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:26:35,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:26:35,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:26:35,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:26:35,319 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:26:35,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:26:35,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:26:35,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:26:35,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:26:35,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:26:35,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:26:35,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:35,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:26:35,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:26:35,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:26:35,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:26:35,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:26:35,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:26:35,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:26:35,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:26:35,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:26:35,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF 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(reach_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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2021-11-20 07:26:35,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:26:35,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:26:35,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:26:35,715 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:26:35,716 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:26:35,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-11-20 07:26:35,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/data/cb5f3456d/4d1849c3ed1544d79bf094d7d3d966f8/FLAGf0b81f404 [2021-11-20 07:26:36,249 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:26:36,250 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-11-20 07:26:36,261 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/data/cb5f3456d/4d1849c3ed1544d79bf094d7d3d966f8/FLAGf0b81f404 [2021-11-20 07:26:36,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/data/cb5f3456d/4d1849c3ed1544d79bf094d7d3d966f8 [2021-11-20 07:26:36,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:26:36,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:26:36,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:36,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:26:36,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:26:36,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:36" (1/1) ... [2021-11-20 07:26:36,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208f1b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:36, skipping insertion in model container [2021-11-20 07:26:36,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:36" (1/1) ... [2021-11-20 07:26:36,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:26:36,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:26:36,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2021-11-20 07:26:37,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2021-11-20 07:26:37,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:37,085 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:26:37,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2021-11-20 07:26:37,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2021-11-20 07:26:37,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:37,168 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:26:37,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37 WrapperNode [2021-11-20 07:26:37,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:37,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:37,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:26:37,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:26:37,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,227 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2021-11-20 07:26:37,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:37,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:26:37,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:26:37,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:26:37,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:26:37,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:26:37,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:26:37,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:26:37,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (1/1) ... [2021-11-20 07:26:37,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:37,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:26:37,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:26:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:26:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-20 07:26:37,395 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-20 07:26:37,395 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-20 07:26:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-20 07:26:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-20 07:26:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-20 07:26:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-20 07:26:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-20 07:26:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-11-20 07:26:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-11-20 07:26:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-20 07:26:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-20 07:26:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-20 07:26:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-20 07:26:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-11-20 07:26:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-11-20 07:26:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-20 07:26:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-20 07:26:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-11-20 07:26:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-11-20 07:26:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-20 07:26:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-20 07:26:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:26:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-20 07:26:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-20 07:26:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-11-20 07:26:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-11-20 07:26:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:26:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:26:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-20 07:26:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-20 07:26:37,494 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:26:37,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:26:38,117 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-11-20 07:26:38,117 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-11-20 07:26:38,168 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:26:38,180 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:26:38,180 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-20 07:26:38,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:38 BoogieIcfgContainer [2021-11-20 07:26:38,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:26:38,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:26:38,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:26:38,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:26:38,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:26:36" (1/3) ... [2021-11-20 07:26:38,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ff06c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:38, skipping insertion in model container [2021-11-20 07:26:38,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:37" (2/3) ... [2021-11-20 07:26:38,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ff06c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:38, skipping insertion in model container [2021-11-20 07:26:38,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:38" (3/3) ... [2021-11-20 07:26:38,199 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-11-20 07:26:38,215 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:26:38,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 07:26:38,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:26:38,268 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:26:38,269 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-20 07:26:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-20 07:26:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:38,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:38,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:38,304 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2021-11-20 07:26:38,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:38,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101203853] [2021-11-20 07:26:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:38,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:38,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101203853] [2021-11-20 07:26:38,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101203853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:38,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:38,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:26:38,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882373032] [2021-11-20 07:26:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:38,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:26:38,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:26:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:26:38,745 INFO L87 Difference]: Start difference. First operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:39,696 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2021-11-20 07:26:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:26:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 07:26:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:39,718 INFO L225 Difference]: With dead ends: 562 [2021-11-20 07:26:39,718 INFO L226 Difference]: Without dead ends: 345 [2021-11-20 07:26:39,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:39,726 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 556 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:39,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 841 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-20 07:26:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2021-11-20 07:26:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2021-11-20 07:26:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2021-11-20 07:26:39,810 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2021-11-20 07:26:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:39,811 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2021-11-20 07:26:39,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2021-11-20 07:26:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:39,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:39,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:39,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:26:39,816 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2021-11-20 07:26:39,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:39,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586216896] [2021-11-20 07:26:39,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:39,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:39,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:40,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:40,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586216896] [2021-11-20 07:26:40,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586216896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:40,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:40,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:40,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826005946] [2021-11-20 07:26:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:40,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:40,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:40,007 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:40,969 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2021-11-20 07:26:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:26:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 07:26:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:40,986 INFO L225 Difference]: With dead ends: 636 [2021-11-20 07:26:40,986 INFO L226 Difference]: Without dead ends: 453 [2021-11-20 07:26:40,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:26:40,995 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 533 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:40,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 1139 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-11-20 07:26:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2021-11-20 07:26:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-11-20 07:26:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2021-11-20 07:26:41,099 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2021-11-20 07:26:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:41,100 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2021-11-20 07:26:41,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2021-11-20 07:26:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:41,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:41,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:41,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:26:41,114 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2021-11-20 07:26:41,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:41,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356764428] [2021-11-20 07:26:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:41,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:41,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356764428] [2021-11-20 07:26:41,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356764428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:41,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:41,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:41,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076918560] [2021-11-20 07:26:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:41,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:41,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:41,307 INFO L87 Difference]: Start difference. First operand 389 states and 547 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:41,817 INFO L93 Difference]: Finished difference Result 719 states and 1023 transitions. [2021-11-20 07:26:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:26:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 07:26:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:41,823 INFO L225 Difference]: With dead ends: 719 [2021-11-20 07:26:41,824 INFO L226 Difference]: Without dead ends: 451 [2021-11-20 07:26:41,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:41,833 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 476 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:41,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 769 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:26:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-20 07:26:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 389. [2021-11-20 07:26:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4207119741100325) internal successors, (439), 315 states have internal predecessors, (439), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-11-20 07:26:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 544 transitions. [2021-11-20 07:26:41,898 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 544 transitions. Word has length 57 [2021-11-20 07:26:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:41,899 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 544 transitions. [2021-11-20 07:26:41,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 544 transitions. [2021-11-20 07:26:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:41,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:41,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:41,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:26:41,902 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2021-11-20 07:26:41,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:41,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645651845] [2021-11-20 07:26:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:41,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:42,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:42,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645651845] [2021-11-20 07:26:42,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645651845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:42,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:42,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:42,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42408743] [2021-11-20 07:26:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:42,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:42,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:42,081 INFO L87 Difference]: Start difference. First operand 389 states and 544 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:42,727 INFO L93 Difference]: Finished difference Result 755 states and 1080 transitions. [2021-11-20 07:26:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:26:42,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 07:26:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:42,733 INFO L225 Difference]: With dead ends: 755 [2021-11-20 07:26:42,733 INFO L226 Difference]: Without dead ends: 488 [2021-11-20 07:26:42,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:26:42,736 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 283 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:42,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 1133 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 07:26:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-11-20 07:26:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 398. [2021-11-20 07:26:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 318 states have (on average 1.4088050314465408) internal successors, (448), 324 states have internal predecessors, (448), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-11-20 07:26:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 553 transitions. [2021-11-20 07:26:42,791 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 553 transitions. Word has length 57 [2021-11-20 07:26:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:42,791 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 553 transitions. [2021-11-20 07:26:42,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 553 transitions. [2021-11-20 07:26:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:42,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:42,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:42,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:26:42,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2021-11-20 07:26:42,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:42,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856945533] [2021-11-20 07:26:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:42,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:42,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:42,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856945533] [2021-11-20 07:26:42,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856945533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:42,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:42,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:42,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877307560] [2021-11-20 07:26:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:42,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:42,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:42,942 INFO L87 Difference]: Start difference. First operand 398 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:44,197 INFO L93 Difference]: Finished difference Result 1553 states and 2246 transitions. [2021-11-20 07:26:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 07:26:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-20 07:26:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:44,210 INFO L225 Difference]: With dead ends: 1553 [2021-11-20 07:26:44,210 INFO L226 Difference]: Without dead ends: 1277 [2021-11-20 07:26:44,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-20 07:26:44,213 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 998 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:44,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1017 Valid, 1044 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 07:26:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2021-11-20 07:26:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1106. [2021-11-20 07:26:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 879 states have (on average 1.3765642775881684) internal successors, (1210), 900 states have internal predecessors, (1210), 138 states have call successors, (138), 80 states have call predecessors, (138), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2021-11-20 07:26:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1537 transitions. [2021-11-20 07:26:44,358 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1537 transitions. Word has length 57 [2021-11-20 07:26:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:44,358 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1537 transitions. [2021-11-20 07:26:44,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:26:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1537 transitions. [2021-11-20 07:26:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 07:26:44,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:44,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:44,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:26:44,361 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2021-11-20 07:26:44,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:44,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200186798] [2021-11-20 07:26:44,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:44,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 07:26:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 07:26:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:44,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200186798] [2021-11-20 07:26:44,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200186798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:44,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:44,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:44,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245453496] [2021-11-20 07:26:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:44,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:44,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:44,528 INFO L87 Difference]: Start difference. First operand 1106 states and 1537 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,312 INFO L93 Difference]: Finished difference Result 1361 states and 1907 transitions. [2021-11-20 07:26:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:26:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 07:26:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,323 INFO L225 Difference]: With dead ends: 1361 [2021-11-20 07:26:45,325 INFO L226 Difference]: Without dead ends: 1257 [2021-11-20 07:26:45,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:26:45,329 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 619 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:45,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 1137 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 07:26:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2021-11-20 07:26:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1218. [2021-11-20 07:26:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 969 states have (on average 1.3797729618163055) internal successors, (1337), 992 states have internal predecessors, (1337), 151 states have call successors, (151), 87 states have call predecessors, (151), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2021-11-20 07:26:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1695 transitions. [2021-11-20 07:26:45,443 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1695 transitions. Word has length 65 [2021-11-20 07:26:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,446 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1695 transitions. [2021-11-20 07:26:45,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1695 transitions. [2021-11-20 07:26:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 07:26:45,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:45,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:26:45,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2021-11-20 07:26:45,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456487264] [2021-11-20 07:26:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 07:26:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 07:26:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:45,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456487264] [2021-11-20 07:26:45,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456487264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:45,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585478394] [2021-11-20 07:26:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:45,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:45,583 INFO L87 Difference]: Start difference. First operand 1218 states and 1695 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:46,562 INFO L93 Difference]: Finished difference Result 1615 states and 2261 transitions. [2021-11-20 07:26:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 07:26:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-11-20 07:26:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:46,575 INFO L225 Difference]: With dead ends: 1615 [2021-11-20 07:26:46,576 INFO L226 Difference]: Without dead ends: 1406 [2021-11-20 07:26:46,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-20 07:26:46,581 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 574 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:46,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 1481 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-11-20 07:26:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1330. [2021-11-20 07:26:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1059 states have (on average 1.3814919735599622) internal successors, (1463), 1084 states have internal predecessors, (1463), 164 states have call successors, (164), 94 states have call predecessors, (164), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2021-11-20 07:26:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1855 transitions. [2021-11-20 07:26:46,707 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1855 transitions. Word has length 65 [2021-11-20 07:26:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:46,708 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1855 transitions. [2021-11-20 07:26:46,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1855 transitions. [2021-11-20 07:26:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-20 07:26:46,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:46,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:46,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:26:46,711 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2021-11-20 07:26:46,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:46,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889314222] [2021-11-20 07:26:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:46,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:26:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-20 07:26:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-20 07:26:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:46,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:46,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889314222] [2021-11-20 07:26:46,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889314222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:46,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:46,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:46,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421039290] [2021-11-20 07:26:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:46,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:46,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:46,860 INFO L87 Difference]: Start difference. First operand 1330 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:47,573 INFO L93 Difference]: Finished difference Result 2002 states and 2797 transitions. [2021-11-20 07:26:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:26:47,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-11-20 07:26:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:47,585 INFO L225 Difference]: With dead ends: 2002 [2021-11-20 07:26:47,585 INFO L226 Difference]: Without dead ends: 1687 [2021-11-20 07:26:47,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:26:47,588 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 825 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:47,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 922 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 07:26:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2021-11-20 07:26:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1611. [2021-11-20 07:26:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1285 states have (on average 1.377431906614786) internal successors, (1770), 1314 states have internal predecessors, (1770), 194 states have call successors, (194), 115 states have call predecessors, (194), 130 states have return successors, (266), 186 states have call predecessors, (266), 192 states have call successors, (266) [2021-11-20 07:26:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2230 transitions. [2021-11-20 07:26:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2230 transitions. Word has length 65 [2021-11-20 07:26:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:47,711 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2230 transitions. [2021-11-20 07:26:47,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2230 transitions. [2021-11-20 07:26:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-20 07:26:47,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:47,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:47,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:26:47,714 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2021-11-20 07:26:47,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:47,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806078664] [2021-11-20 07:26:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:47,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:47,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:47,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806078664] [2021-11-20 07:26:47,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806078664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:47,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:47,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:47,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974941945] [2021-11-20 07:26:47,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:47,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:47,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:47,834 INFO L87 Difference]: Start difference. First operand 1611 states and 2230 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:48,497 INFO L93 Difference]: Finished difference Result 2285 states and 3166 transitions. [2021-11-20 07:26:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:26:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-11-20 07:26:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:48,514 INFO L225 Difference]: With dead ends: 2285 [2021-11-20 07:26:48,514 INFO L226 Difference]: Without dead ends: 1689 [2021-11-20 07:26:48,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:26:48,521 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 329 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:48,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 1342 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:26:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2021-11-20 07:26:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1626. [2021-11-20 07:26:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1297 states have (on average 1.371626831148805) internal successors, (1779), 1326 states have internal predecessors, (1779), 194 states have call successors, (194), 115 states have call predecessors, (194), 133 states have return successors, (269), 189 states have call predecessors, (269), 192 states have call successors, (269) [2021-11-20 07:26:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2242 transitions. [2021-11-20 07:26:48,700 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2242 transitions. Word has length 66 [2021-11-20 07:26:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:48,700 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 2242 transitions. [2021-11-20 07:26:48,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2242 transitions. [2021-11-20 07:26:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-20 07:26:48,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:48,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:48,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:26:48,711 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2021-11-20 07:26:48,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:48,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985940495] [2021-11-20 07:26:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:48,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-20 07:26:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-20 07:26:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:48,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:48,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985940495] [2021-11-20 07:26:48,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985940495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:48,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:48,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:48,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748619463] [2021-11-20 07:26:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:48,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:48,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:48,874 INFO L87 Difference]: Start difference. First operand 1626 states and 2242 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:50,908 INFO L93 Difference]: Finished difference Result 3831 states and 5363 transitions. [2021-11-20 07:26:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 07:26:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2021-11-20 07:26:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:50,923 INFO L225 Difference]: With dead ends: 3831 [2021-11-20 07:26:50,924 INFO L226 Difference]: Without dead ends: 1989 [2021-11-20 07:26:50,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 07:26:50,932 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 1464 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:50,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1613 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 07:26:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2021-11-20 07:26:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1834. [2021-11-20 07:26:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1449 states have (on average 1.3547273982056591) internal successors, (1963), 1482 states have internal predecessors, (1963), 224 states have call successors, (224), 136 states have call predecessors, (224), 159 states have return successors, (318), 220 states have call predecessors, (318), 222 states have call successors, (318) [2021-11-20 07:26:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2505 transitions. [2021-11-20 07:26:51,089 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2505 transitions. Word has length 66 [2021-11-20 07:26:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:51,090 INFO L470 AbstractCegarLoop]: Abstraction has 1834 states and 2505 transitions. [2021-11-20 07:26:51,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 07:26:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2505 transitions. [2021-11-20 07:26:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-20 07:26:51,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:51,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:51,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:26:51,094 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -801093477, now seen corresponding path program 1 times [2021-11-20 07:26:51,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:51,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945005000] [2021-11-20 07:26:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:51,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 07:26:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 07:26:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:51,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945005000] [2021-11-20 07:26:51,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945005000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:51,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:51,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:26:51,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228674860] [2021-11-20 07:26:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:51,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:26:51,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:26:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:26:51,240 INFO L87 Difference]: Start difference. First operand 1834 states and 2505 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:51,926 INFO L93 Difference]: Finished difference Result 2798 states and 3825 transitions. [2021-11-20 07:26:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:26:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-11-20 07:26:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:51,941 INFO L225 Difference]: With dead ends: 2798 [2021-11-20 07:26:51,942 INFO L226 Difference]: Without dead ends: 1979 [2021-11-20 07:26:51,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:26:51,947 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 218 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:51,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 1413 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 07:26:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2021-11-20 07:26:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1879. [2021-11-20 07:26:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1485 states have (on average 1.346127946127946) internal successors, (1999), 1518 states have internal predecessors, (1999), 224 states have call successors, (224), 136 states have call predecessors, (224), 168 states have return successors, (327), 229 states have call predecessors, (327), 222 states have call successors, (327) [2021-11-20 07:26:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2550 transitions. [2021-11-20 07:26:52,123 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2550 transitions. Word has length 67 [2021-11-20 07:26:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:52,124 INFO L470 AbstractCegarLoop]: Abstraction has 1879 states and 2550 transitions. [2021-11-20 07:26:52,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2550 transitions. [2021-11-20 07:26:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-20 07:26:52,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:52,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:52,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:26:52,128 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash 585109917, now seen corresponding path program 1 times [2021-11-20 07:26:52,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:52,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295927138] [2021-11-20 07:26:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:52,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 07:26:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 07:26:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:52,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:52,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295927138] [2021-11-20 07:26:52,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295927138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:52,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:52,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:26:52,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111435700] [2021-11-20 07:26:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:52,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:26:52,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:52,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:26:52,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:52,233 INFO L87 Difference]: Start difference. First operand 1879 states and 2550 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:53,196 INFO L93 Difference]: Finished difference Result 2859 states and 3853 transitions. [2021-11-20 07:26:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 07:26:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2021-11-20 07:26:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:53,211 INFO L225 Difference]: With dead ends: 2859 [2021-11-20 07:26:53,212 INFO L226 Difference]: Without dead ends: 2082 [2021-11-20 07:26:53,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-11-20 07:26:53,216 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 741 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:53,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [764 Valid, 915 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 07:26:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2021-11-20 07:26:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1888. [2021-11-20 07:26:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1494 states have (on average 1.3427041499330656) internal successors, (2006), 1525 states have internal predecessors, (2006), 225 states have call successors, (225), 137 states have call predecessors, (225), 167 states have return successors, (323), 230 states have call predecessors, (323), 223 states have call successors, (323) [2021-11-20 07:26:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2554 transitions. [2021-11-20 07:26:53,381 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2554 transitions. Word has length 67 [2021-11-20 07:26:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:53,381 INFO L470 AbstractCegarLoop]: Abstraction has 1888 states and 2554 transitions. [2021-11-20 07:26:53,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2554 transitions. [2021-11-20 07:26:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-20 07:26:53,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:53,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:53,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:26:53,385 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash 451096411, now seen corresponding path program 1 times [2021-11-20 07:26:53,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605116758] [2021-11-20 07:26:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:53,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 07:26:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 07:26:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:53,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:53,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605116758] [2021-11-20 07:26:53,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605116758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:53,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:53,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:26:53,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328391519] [2021-11-20 07:26:53,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:53,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:53,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:26:53,494 INFO L87 Difference]: Start difference. First operand 1888 states and 2554 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:54,094 INFO L93 Difference]: Finished difference Result 3773 states and 5076 transitions. [2021-11-20 07:26:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:26:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2021-11-20 07:26:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:54,114 INFO L225 Difference]: With dead ends: 3773 [2021-11-20 07:26:54,114 INFO L226 Difference]: Without dead ends: 2903 [2021-11-20 07:26:54,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:26:54,119 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 549 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:54,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 820 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:26:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2021-11-20 07:26:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2737. [2021-11-20 07:26:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2148 states have (on average 1.3198324022346368) internal successors, (2835), 2192 states have internal predecessors, (2835), 329 states have call successors, (329), 201 states have call predecessors, (329), 258 states have return successors, (513), 351 states have call predecessors, (513), 327 states have call successors, (513) [2021-11-20 07:26:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3677 transitions. [2021-11-20 07:26:54,355 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3677 transitions. Word has length 67 [2021-11-20 07:26:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:54,356 INFO L470 AbstractCegarLoop]: Abstraction has 2737 states and 3677 transitions. [2021-11-20 07:26:54,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-20 07:26:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3677 transitions. [2021-11-20 07:26:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-20 07:26:54,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:54,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:54,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:26:54,360 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 678625623, now seen corresponding path program 1 times [2021-11-20 07:26:54,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:54,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161030988] [2021-11-20 07:26:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:54,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-20 07:26:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 07:26:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-20 07:26:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-20 07:26:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:54,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161030988] [2021-11-20 07:26:54,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161030988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:54,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:54,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:26:54,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426392286] [2021-11-20 07:26:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:54,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:26:54,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:26:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:26:54,441 INFO L87 Difference]: Start difference. First operand 2737 states and 3677 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:54,872 INFO L93 Difference]: Finished difference Result 4460 states and 6033 transitions. [2021-11-20 07:26:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:26:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-11-20 07:26:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:54,880 INFO L225 Difference]: With dead ends: 4460 [2021-11-20 07:26:54,881 INFO L226 Difference]: Without dead ends: 995 [2021-11-20 07:26:54,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:54,891 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 525 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:54,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 495 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:26:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2021-11-20 07:26:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2021-11-20 07:26:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 792 states have (on average 1.3674242424242424) internal successors, (1083), 810 states have internal predecessors, (1083), 122 states have call successors, (122), 72 states have call predecessors, (122), 80 states have return successors, (175), 114 states have call predecessors, (175), 122 states have call successors, (175) [2021-11-20 07:26:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1380 transitions. [2021-11-20 07:26:54,968 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1380 transitions. Word has length 68 [2021-11-20 07:26:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:54,968 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 1380 transitions. [2021-11-20 07:26:54,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-20 07:26:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1380 transitions. [2021-11-20 07:26:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-20 07:26:54,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:54,971 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:54,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:26:54,972 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1894779564, now seen corresponding path program 1 times [2021-11-20 07:26:54,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654570779] [2021-11-20 07:26:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:54,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 07:26:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 07:26:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:26:55,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654570779] [2021-11-20 07:26:55,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654570779] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630479428] [2021-11-20 07:26:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:55,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:55,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:55,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:26:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:55,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 07:26:55,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:55,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630479428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:55,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:55,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 07:26:55,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859983675] [2021-11-20 07:26:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:55,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:55,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:55,474 INFO L87 Difference]: Start difference. First operand 995 states and 1380 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:26:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:55,677 INFO L93 Difference]: Finished difference Result 2871 states and 4007 transitions. [2021-11-20 07:26:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2021-11-20 07:26:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:55,687 INFO L225 Difference]: With dead ends: 2871 [2021-11-20 07:26:55,687 INFO L226 Difference]: Without dead ends: 1241 [2021-11-20 07:26:55,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:55,695 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:55,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-11-20 07:26:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2021-11-20 07:26:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 990 states have (on average 1.3606060606060606) internal successors, (1347), 1010 states have internal predecessors, (1347), 150 states have call successors, (150), 90 states have call predecessors, (150), 100 states have return successors, (217), 142 states have call predecessors, (217), 150 states have call successors, (217) [2021-11-20 07:26:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1714 transitions. [2021-11-20 07:26:55,811 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1714 transitions. Word has length 92 [2021-11-20 07:26:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:55,812 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1714 transitions. [2021-11-20 07:26:55,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:26:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1714 transitions. [2021-11-20 07:26:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-20 07:26:55,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:55,816 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:55,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:56,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 07:26:56,038 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1224402848, now seen corresponding path program 1 times [2021-11-20 07:26:56,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095561112] [2021-11-20 07:26:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:56,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-20 07:26:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-20 07:26:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-20 07:26:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-20 07:26:56,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:56,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095561112] [2021-11-20 07:26:56,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095561112] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:56,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866883220] [2021-11-20 07:26:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:56,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:56,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:56,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:26:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:56,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 07:26:56,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:56,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866883220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:56,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:56,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-11-20 07:26:56,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681176416] [2021-11-20 07:26:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:56,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:56,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:56,484 INFO L87 Difference]: Start difference. First operand 1241 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 07:26:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:56,658 INFO L93 Difference]: Finished difference Result 2958 states and 4125 transitions. [2021-11-20 07:26:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2021-11-20 07:26:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:56,673 INFO L225 Difference]: With dead ends: 2958 [2021-11-20 07:26:56,673 INFO L226 Difference]: Without dead ends: 1960 [2021-11-20 07:26:56,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:56,678 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:56,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2021-11-20 07:26:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1934. [2021-11-20 07:26:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1548 states have (on average 1.3585271317829457) internal successors, (2103), 1577 states have internal predecessors, (2103), 228 states have call successors, (228), 141 states have call predecessors, (228), 157 states have return successors, (321), 217 states have call predecessors, (321), 228 states have call successors, (321) [2021-11-20 07:26:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2652 transitions. [2021-11-20 07:26:56,884 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2652 transitions. Word has length 118 [2021-11-20 07:26:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:56,884 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 2652 transitions. [2021-11-20 07:26:56,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 07:26:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2652 transitions. [2021-11-20 07:26:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-20 07:26:56,890 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:56,890 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 07:26:56,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:57,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:57,106 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1746596599, now seen corresponding path program 1 times [2021-11-20 07:26:57,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:57,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072955815] [2021-11-20 07:26:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:57,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:26:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 07:26:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-20 07:26:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-20 07:26:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-20 07:26:57,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072955815] [2021-11-20 07:26:57,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072955815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513698494] [2021-11-20 07:26:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:57,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:57,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:57,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:57,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:26:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:57,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:26:57,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-20 07:26:57,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:57,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513698494] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:57,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:57,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 07:26:57,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079028320] [2021-11-20 07:26:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:57,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:57,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:57,666 INFO L87 Difference]: Start difference. First operand 1934 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 07:26:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:57,823 INFO L93 Difference]: Finished difference Result 4164 states and 5762 transitions. [2021-11-20 07:26:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:57,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2021-11-20 07:26:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:57,837 INFO L225 Difference]: With dead ends: 4164 [2021-11-20 07:26:57,837 INFO L226 Difference]: Without dead ends: 2240 [2021-11-20 07:26:57,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:57,844 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:57,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2021-11-20 07:26:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2174. [2021-11-20 07:26:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1767 states have (on average 1.2874929258630448) internal successors, (2275), 1793 states have internal predecessors, (2275), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2021-11-20 07:26:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2818 transitions. [2021-11-20 07:26:58,005 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2818 transitions. Word has length 134 [2021-11-20 07:26:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:58,005 INFO L470 AbstractCegarLoop]: Abstraction has 2174 states and 2818 transitions. [2021-11-20 07:26:58,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 07:26:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2818 transitions. [2021-11-20 07:26:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-20 07:26:58,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:58,011 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 07:26:58,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-20 07:26:58,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:58,227 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1255738600, now seen corresponding path program 1 times [2021-11-20 07:26:58,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:58,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974810336] [2021-11-20 07:26:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:58,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:26:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-20 07:26:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-20 07:26:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-20 07:26:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-20 07:26:58,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:58,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974810336] [2021-11-20 07:26:58,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974810336] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:58,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929513257] [2021-11-20 07:26:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:58,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:58,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:58,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:26:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:58,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 07:26:58,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 07:26:58,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:58,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929513257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:58,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:58,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 07:26:58,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682271545] [2021-11-20 07:26:58,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:58,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:58,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:58,725 INFO L87 Difference]: Start difference. First operand 2174 states and 2818 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 07:26:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:58,912 INFO L93 Difference]: Finished difference Result 4387 states and 5717 transitions. [2021-11-20 07:26:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2021-11-20 07:26:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:58,927 INFO L225 Difference]: With dead ends: 4387 [2021-11-20 07:26:58,927 INFO L226 Difference]: Without dead ends: 2225 [2021-11-20 07:26:58,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:58,935 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 118 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:58,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:26:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2021-11-20 07:26:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2156. [2021-11-20 07:26:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1749 states have (on average 1.2595769010863351) internal successors, (2203), 1775 states have internal predecessors, (2203), 228 states have call successors, (228), 159 states have call predecessors, (228), 178 states have return successors, (315), 223 states have call predecessors, (315), 228 states have call successors, (315) [2021-11-20 07:26:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2746 transitions. [2021-11-20 07:26:59,133 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2746 transitions. Word has length 134 [2021-11-20 07:26:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:59,133 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2746 transitions. [2021-11-20 07:26:59,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-20 07:26:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2746 transitions. [2021-11-20 07:26:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-20 07:26:59,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:59,139 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:59,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:59,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 07:26:59,355 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 429240706, now seen corresponding path program 1 times [2021-11-20 07:26:59,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027014640] [2021-11-20 07:26:59,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:59,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:26:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:26:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:26:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:26:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:26:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:26:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:26:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-20 07:26:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-20 07:26:59,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027014640] [2021-11-20 07:26:59,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027014640] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12240450] [2021-11-20 07:26:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:59,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:59,501 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:59,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 07:26:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:59,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 07:26:59,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 07:26:59,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:59,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12240450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:59,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:59,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-20 07:26:59,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104315015] [2021-11-20 07:26:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:59,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:59,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:59,847 INFO L87 Difference]: Start difference. First operand 2156 states and 2746 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-20 07:27:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:00,002 INFO L93 Difference]: Finished difference Result 3081 states and 4000 transitions. [2021-11-20 07:27:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:27:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2021-11-20 07:27:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:00,026 INFO L225 Difference]: With dead ends: 3081 [2021-11-20 07:27:00,026 INFO L226 Difference]: Without dead ends: 1990 [2021-11-20 07:27:00,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:27:00,031 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:00,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 365 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:27:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-11-20 07:27:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1952. [2021-11-20 07:27:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1587 states have (on average 1.238815374921235) internal successors, (1966), 1611 states have internal predecessors, (1966), 206 states have call successors, (206), 144 states have call predecessors, (206), 158 states have return successors, (275), 198 states have call predecessors, (275), 206 states have call successors, (275) [2021-11-20 07:27:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2447 transitions. [2021-11-20 07:27:00,176 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2447 transitions. Word has length 135 [2021-11-20 07:27:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:00,176 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2447 transitions. [2021-11-20 07:27:00,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-20 07:27:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2447 transitions. [2021-11-20 07:27:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 07:27:00,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:00,181 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:00,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:00,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:00,394 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1638887588, now seen corresponding path program 1 times [2021-11-20 07:27:00,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:00,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315245291] [2021-11-20 07:27:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:00,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:27:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:27:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:27:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:27:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:27:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:27:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:27:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 07:27:00,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:00,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315245291] [2021-11-20 07:27:00,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315245291] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:00,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979892459] [2021-11-20 07:27:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:00,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:00,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:00,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 07:27:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 07:27:00,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 07:27:00,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:00,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979892459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:00,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:00,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-20 07:27:00,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617510950] [2021-11-20 07:27:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:00,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:27:00,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:27:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:27:00,888 INFO L87 Difference]: Start difference. First operand 1952 states and 2447 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:01,215 INFO L93 Difference]: Finished difference Result 3288 states and 4159 transitions. [2021-11-20 07:27:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:27:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 07:27:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:01,239 INFO L225 Difference]: With dead ends: 3288 [2021-11-20 07:27:01,239 INFO L226 Difference]: Without dead ends: 1945 [2021-11-20 07:27:01,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:27:01,245 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 134 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:01,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 255 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:27:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2021-11-20 07:27:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1386. [2021-11-20 07:27:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1129 states have (on average 1.2063773250664305) internal successors, (1362), 1143 states have internal predecessors, (1362), 148 states have call successors, (148), 101 states have call predecessors, (148), 108 states have return successors, (183), 142 states have call predecessors, (183), 148 states have call successors, (183) [2021-11-20 07:27:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1693 transitions. [2021-11-20 07:27:01,398 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1693 transitions. Word has length 136 [2021-11-20 07:27:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:01,399 INFO L470 AbstractCegarLoop]: Abstraction has 1386 states and 1693 transitions. [2021-11-20 07:27:01,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1693 transitions. [2021-11-20 07:27:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 07:27:01,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:01,402 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:01,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:01,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:01,618 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 331745190, now seen corresponding path program 1 times [2021-11-20 07:27:01,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:01,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026075975] [2021-11-20 07:27:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:01,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:27:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:27:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:27:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:27:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:27:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:27:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:27:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 07:27:01,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:01,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026075975] [2021-11-20 07:27:01,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026075975] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560484220] [2021-11-20 07:27:01,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:01,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:01,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:01,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:01,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 07:27:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 07:27:01,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 07:27:02,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:02,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560484220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:02,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:02,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-20 07:27:02,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087645135] [2021-11-20 07:27:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:02,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:27:02,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:27:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:27:02,160 INFO L87 Difference]: Start difference. First operand 1386 states and 1693 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:02,387 INFO L93 Difference]: Finished difference Result 2506 states and 3064 transitions. [2021-11-20 07:27:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:27:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 07:27:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:02,392 INFO L225 Difference]: With dead ends: 2506 [2021-11-20 07:27:02,392 INFO L226 Difference]: Without dead ends: 1132 [2021-11-20 07:27:02,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:27:02,396 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 155 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:02,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 265 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:27:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-11-20 07:27:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1110. [2021-11-20 07:27:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 911 states have (on average 1.1525795828759604) internal successors, (1050), 921 states have internal predecessors, (1050), 110 states have call successors, (110), 79 states have call predecessors, (110), 88 states have return successors, (134), 110 states have call predecessors, (134), 110 states have call successors, (134) [2021-11-20 07:27:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1294 transitions. [2021-11-20 07:27:02,491 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1294 transitions. Word has length 136 [2021-11-20 07:27:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:02,492 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1294 transitions. [2021-11-20 07:27:02,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1294 transitions. [2021-11-20 07:27:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 07:27:02,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:02,495 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:02,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:02,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-20 07:27:02,716 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2065725340, now seen corresponding path program 1 times [2021-11-20 07:27:02,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:02,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615677950] [2021-11-20 07:27:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:02,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:27:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:27:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:27:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:27:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:27:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:27:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:27:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-20 07:27:02,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615677950] [2021-11-20 07:27:02,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615677950] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50129921] [2021-11-20 07:27:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:02,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:02,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:02,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 07:27:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 07:27:02,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-20 07:27:03,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:03,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50129921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:03,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:03,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-11-20 07:27:03,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662129179] [2021-11-20 07:27:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:03,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:27:03,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:27:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:27:03,210 INFO L87 Difference]: Start difference. First operand 1110 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:03,389 INFO L93 Difference]: Finished difference Result 2237 states and 2669 transitions. [2021-11-20 07:27:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:27:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-11-20 07:27:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:03,394 INFO L225 Difference]: With dead ends: 2237 [2021-11-20 07:27:03,394 INFO L226 Difference]: Without dead ends: 1138 [2021-11-20 07:27:03,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:27:03,399 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 10 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:03,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:27:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2021-11-20 07:27:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1122. [2021-11-20 07:27:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 923 states have (on average 1.1278439869989165) internal successors, (1041), 933 states have internal predecessors, (1041), 110 states have call successors, (110), 79 states have call predecessors, (110), 88 states have return successors, (134), 110 states have call predecessors, (134), 110 states have call successors, (134) [2021-11-20 07:27:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1285 transitions. [2021-11-20 07:27:03,505 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1285 transitions. Word has length 136 [2021-11-20 07:27:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:03,505 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1285 transitions. [2021-11-20 07:27:03,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-20 07:27:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1285 transitions. [2021-11-20 07:27:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-20 07:27:03,509 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:03,509 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-20 07:27:03,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:03,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 07:27:03,724 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1471946848, now seen corresponding path program 1 times [2021-11-20 07:27:03,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:03,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421246534] [2021-11-20 07:27:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:03,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:27:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:27:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:27:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:27:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:27:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:27:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:27:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-20 07:27:03,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:03,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421246534] [2021-11-20 07:27:03,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421246534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:03,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:03,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:27:03,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897934582] [2021-11-20 07:27:03,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:03,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:27:03,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:03,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:27:03,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:27:03,853 INFO L87 Difference]: Start difference. First operand 1122 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-20 07:27:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:04,491 INFO L93 Difference]: Finished difference Result 2097 states and 2382 transitions. [2021-11-20 07:27:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 07:27:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-11-20 07:27:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:04,499 INFO L225 Difference]: With dead ends: 2097 [2021-11-20 07:27:04,499 INFO L226 Difference]: Without dead ends: 2095 [2021-11-20 07:27:04,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-20 07:27:04,506 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 473 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:04,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 502 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:27:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2021-11-20 07:27:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1826. [2021-11-20 07:27:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1503 states have (on average 1.1250831669993346) internal successors, (1691), 1519 states have internal predecessors, (1691), 178 states have call successors, (178), 127 states have call predecessors, (178), 144 states have return successors, (213), 180 states have call predecessors, (213), 178 states have call successors, (213) [2021-11-20 07:27:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2082 transitions. [2021-11-20 07:27:04,800 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2082 transitions. Word has length 136 [2021-11-20 07:27:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:04,800 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 2082 transitions. [2021-11-20 07:27:04,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-20 07:27:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2082 transitions. [2021-11-20 07:27:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-20 07:27:04,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:04,808 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:04,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-20 07:27:04,809 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -609020054, now seen corresponding path program 2 times [2021-11-20 07:27:04,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:04,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091860466] [2021-11-20 07:27:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:04,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-20 07:27:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-20 07:27:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 07:27:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-20 07:27:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:27:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 07:27:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-20 07:27:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-20 07:27:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 07:27:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-20 07:27:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-11-20 07:27:04,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:04,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091860466] [2021-11-20 07:27:04,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091860466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:04,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:04,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:27:04,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073312756] [2021-11-20 07:27:04,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:04,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:27:04,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:04,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:27:04,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:27:04,926 INFO L87 Difference]: Start difference. First operand 1826 states and 2082 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 07:27:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:05,677 INFO L93 Difference]: Finished difference Result 3695 states and 4226 transitions. [2021-11-20 07:27:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 07:27:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2021-11-20 07:27:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:05,679 INFO L225 Difference]: With dead ends: 3695 [2021-11-20 07:27:05,679 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 07:27:05,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:27:05,688 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 581 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:05,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 435 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 07:27:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 07:27:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 07:27:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:27:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 07:27:05,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2021-11-20 07:27:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:05,690 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 07:27:05,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 07:27:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 07:27:05,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 07:27:05,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-20 07:27:05,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-20 07:27:05,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 07:27:05,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 07:27:57,050 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2021-11-20 07:27:57,050 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 915 925) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse12 (= ~E_M~0 0)) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse5 (not (<= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse10) (or .cse0 (and (not (< 0 ~m_pc~0)) (not (<= 1 ~t1_pc~0))) .cse11 .cse3 .cse5 .cse7 .cse12 (and (or (not (< 1 ~m_pc~0)) (not (<= ~t1_pc~0 1))) (not (<= ~m_pc~0 0))) .cse10) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 (not (< ~token~0 (+ 2 ~local~0))) (not (<= (+ ~local~0 1) ~token~0)) .cse10 (not (<= 2 ~E_1~0))))) [2021-11-20 07:27:57,050 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2021-11-20 07:27:57,051 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2021-11-20 07:27:57,051 INFO L861 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: true [2021-11-20 07:27:57,051 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: (let ((.cse7 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse6 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6))) [2021-11-20 07:27:57,051 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2021-11-20 07:27:57,052 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2021-11-20 07:27:57,052 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2021-11-20 07:27:57,052 INFO L858 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2021-11-20 07:27:57,052 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2021-11-20 07:27:57,052 INFO L858 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2021-11-20 07:27:57,053 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse15 (= ~E_M~0 0)) (.cse13 (not (< ~token~0 (+ 2 ~local~0)))) (.cse14 (not (<= (+ ~local~0 1) ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse13 .cse8 .cse14 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 .cse2 .cse4 .cse6 .cse7 .cse15 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse15 .cse13 .cse14 .cse10 .cse11))) [2021-11-20 07:27:57,053 INFO L854 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse20 (= ~E_M~0 0)) (.cse29 (< 1 ~m_pc~0)) (.cse28 (<= ~m_pc~0 0))) (let ((.cse30 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse31 (<= 2 ~m_st~0)) (.cse32 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse34 (= ~p_dw_st~0 0)) (.cse26 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse27 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (or .cse29 .cse28)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (not .cse20)) (.cse35 (= ~c_dr_pc~0 0))) (let ((.cse19 (and .cse36 .cse10 .cse11 .cse33 .cse35)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse25 (not (= |old(~m_st~0)| 0))) (.cse21 (and (not .cse29) (not .cse28))) (.cse14 (not (= ~M_E~0 2))) (.cse6 (not (<= 2 ~E_M~0))) (.cse16 (and .cse26 .cse27)) (.cse17 (and (= ~T1_E~0 ~M_E~0) .cse36 .cse10 .cse30 .cse11 .cse31 .cse32 .cse33 .cse34 .cse35)) (.cse0 (not .cse34)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse3 (not .cse30)) (.cse13 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse23 (not (< ~token~0 (+ 2 ~local~0)))) (.cse24 (not (<= (+ ~local~0 1) ~token~0))) (.cse8 (not .cse32)) (.cse9 (and .cse10 .cse11 .cse26 .cse27)) (.cse22 (and (or .cse28 (and (<= ~t1_pc~0 1) .cse29)) .cse10 .cse30 .cse11 .cse31 .cse32 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse33 .cse34 .cse35)) (.cse18 (not (<= 2 ~E_1~0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (and .cse10 .cse11) .cse12 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18) (or .cse19 .cse0 .cse15 .cse3 .cse5 .cse20 .cse8 .cse21) (or .cse0 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse18) (or .cse19 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18) (or .cse0 .cse2 .cse12 .cse3 .cse13 .cse5 .cse23 .cse6 .cse24 .cse8 .cse9 .cse25 .cse18) (or .cse0 .cse14 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse20 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse16 .cse7 .cse8 .cse25 .cse21 .cse18) (or .cse0 .cse14 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse23 .cse16 .cse24 .cse8 .cse17 .cse18) (or .cse0 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse8 .cse9 .cse22 .cse18) (or .cse0 .cse14 .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse6 .cse16 .cse8 .cse17 .cse18) (or .cse0 (and (= ~m_st~0 0) .cse26 .cse27 (not (= ~t1_st~0 0))) .cse15 .cse2 .cse12 .cse3 .cse13 .cse5 .cse20 .cse23 .cse24 .cse8 .cse9 .cse22 .cse18))))) [2021-11-20 07:27:57,053 INFO L858 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2021-11-20 07:27:57,054 INFO L854 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (= ~E_M~0 0)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse17 (not (< ~token~0 (+ 2 ~local~0)))) (.cse18 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse15 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse16 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse14 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (or .cse1 .cse3 .cse4 (and .cse15 .cse16) .cse12 .cse5 .cse13 .cse7 .cse14 .cse17 .cse18 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse17 .cse8 .cse18 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2021-11-20 07:27:57,054 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2021-11-20 07:27:57,054 INFO L854 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse20 (= ~E_M~0 0)) (.cse38 (< 1 ~m_pc~0)) (.cse37 (<= ~m_pc~0 0))) (let ((.cse26 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse27 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse28 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse29 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse31 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (= ~p_dw_st~0 0)) (.cse30 (or .cse38 .cse37)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (not .cse20)) (.cse36 (= ~c_dr_pc~0 0))) (let ((.cse16 (and .cse30 .cse3 .cse4 .cse34 .cse36)) (.cse13 (and (not .cse38) (not .cse37))) (.cse25 (and (or .cse37 (and (<= ~t1_pc~0 1) .cse38)) .cse3 .cse31 .cse4 .cse32 .cse33 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse34 .cse35 .cse36)) (.cse5 (not (= ~t1_pc~0 1))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse22 (not (< ~token~0 (+ 2 ~local~0)))) (.cse23 (not (<= (+ ~local~0 1) ~token~0))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse19 (and .cse3 .cse4 .cse26 .cse27 .cse28 .cse29)) (.cse0 (not .cse35)) (.cse21 (not (= ~M_E~0 2))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse6 (not .cse31)) (.cse18 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse33)) (.cse24 (and (= ~T1_E~0 ~M_E~0) .cse30 .cse3 .cse31 .cse4 .cse32 .cse33 .cse34 .cse35 .cse36)) (.cse14 (not (<= 2 ~E_1~0))) (.cse15 (and .cse26 .cse27 .cse28 .cse29))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse1 .cse17 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse14) (or .cse16 .cse0 .cse17 .cse6 .cse8 .cse20 .cse11 .cse13) (or .cse0 .cse21 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse22 .cse23 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse25 .cse14) (or .cse0 .cse1 .cse17 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse19 .cse25 .cse14) (or .cse0 .cse21 .cse1 .cse17 .cse2 .cse5 .cse6 .cse8 .cse20 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse22 .cse23 (and (= ~m_st~0 0) .cse26 .cse27 .cse28 (not (= ~t1_st~0 0)) .cse29) .cse11 .cse19 .cse25 .cse14) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19) (or .cse0 .cse21 .cse17 .cse2 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse24 .cse14 .cse15) (or .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse23 .cse11 .cse12 .cse19 .cse14) (or .cse0 .cse21 .cse1 .cse17 .cse2 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15))))) [2021-11-20 07:27:57,054 INFO L858 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2021-11-20 07:27:57,055 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2021-11-20 07:27:57,055 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2021-11-20 07:27:57,055 INFO L858 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2021-11-20 07:27:57,055 INFO L854 garLoopResultBuilder]: At program point L714(lines 702 716) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse14 (not (< ~token~0 (+ 2 ~local~0)))) (.cse15 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse18 (= ~E_M~0 0)) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15 .cse10 (not (= |old(~m_st~0)| 0)) .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse4 (and .cse16 .cse17) .cse12 .cse5 .cse13 .cse7 .cse18 .cse14 .cse15 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse18 .cse10 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))))) [2021-11-20 07:27:57,055 INFO L858 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2021-11-20 07:27:57,056 INFO L858 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2021-11-20 07:27:57,056 INFO L858 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2021-11-20 07:27:57,056 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (let ((.cse6 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5))) [2021-11-20 07:27:57,056 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2021-11-20 07:27:57,056 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2021-11-20 07:27:57,056 INFO L858 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2021-11-20 07:27:57,057 INFO L858 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2021-11-20 07:27:57,057 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-11-20 07:27:57,057 INFO L854 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse6 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse3 (= ~E_M~0 0)) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse9 .cse5))) [2021-11-20 07:27:57,057 INFO L854 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse15 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse11 (and .cse15 .cse14 (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse6 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse13 (not (= ~c_dr_pc~0 0))) (.cse2 (and .cse15 .cse14)) (.cse3 (= ~E_M~0 0)) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse11 .cse12 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse8) (or .cse0 .cse1 .cse13 .cse14 .cse3 .cse5 .cse8 (not (= |old(~p_dw_st~0)| 0)) .cse9) (or .cse15 .cse0 .cse1 .cse13 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse13 .cse2 .cse3 (= ~p_dw_st~0 0) .cse5 .cse8 .cse9)))) [2021-11-20 07:27:57,058 INFO L858 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2021-11-20 07:27:57,058 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2021-11-20 07:27:57,058 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2021-11-20 07:27:57,058 INFO L858 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2021-11-20 07:27:57,058 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse14 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (<= 2 |old(~T1_E~0)|))) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) .cse8 .cse9 (not (<= (+ ~local~0 1) ~token~0)) .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 0) .cse3 .cse6 .cse8 .cse10 .cse15) (or .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse15))) [2021-11-20 07:27:57,059 INFO L858 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2021-11-20 07:27:57,059 INFO L858 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2021-11-20 07:27:57,059 INFO L858 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2021-11-20 07:27:57,059 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2021-11-20 07:27:57,059 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~E_M~0 0)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse7))) [2021-11-20 07:27:57,059 INFO L858 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2021-11-20 07:27:57,060 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2021-11-20 07:27:57,060 INFO L858 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2021-11-20 07:27:57,060 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2021-11-20 07:27:57,060 INFO L854 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (= ~E_M~0 0)) (.cse3 (not (= ~T1_E~0 ~M_E~0))) (.cse4 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse5 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (not (<= 1 ~p_dw_pc~0))) (or .cse0 .cse1 (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse3 .cse4 .cse5))) [2021-11-20 07:27:57,060 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-11-20 07:27:57,060 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2021-11-20 07:27:57,061 INFO L858 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2021-11-20 07:27:57,062 INFO L854 garLoopResultBuilder]: At program point L828(lines 783 833) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,062 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-11-20 07:27:57,062 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2021-11-20 07:27:57,062 INFO L861 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: true [2021-11-20 07:27:57,062 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,062 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2021-11-20 07:27:57,062 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2021-11-20 07:27:57,062 INFO L854 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2021-11-20 07:27:57,063 INFO L858 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2021-11-20 07:27:57,063 INFO L854 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,063 INFO L858 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2021-11-20 07:27:57,063 INFO L858 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2021-11-20 07:27:57,063 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2021-11-20 07:27:57,063 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse5 (<= 1 ~p_dw_pc~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~M_E~0 2))) (let ((.cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~p_dw_pc~0 0) .cse2 .cse3 .cse4 .cse6 .cse7))) (.cse1 (<= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7) (and .cse0 (<= 1 ~c_dr_pc~0) .cse1)))) [2021-11-20 07:27:57,064 INFO L854 garLoopResultBuilder]: At program point L932(lines 926 934) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,064 INFO L858 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2021-11-20 07:27:57,064 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-11-20 07:27:57,064 INFO L858 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2021-11-20 07:27:57,064 INFO L854 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (= ~M_E~0 2) [2021-11-20 07:27:57,064 INFO L854 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,065 INFO L858 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2021-11-20 07:27:57,065 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-11-20 07:27:57,065 INFO L854 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2021-11-20 07:27:57,065 INFO L858 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2021-11-20 07:27:57,065 INFO L858 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2021-11-20 07:27:57,065 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2021-11-20 07:27:57,066 INFO L854 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: (= ~M_E~0 2) [2021-11-20 07:27:57,066 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2021-11-20 07:27:57,066 INFO L858 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2021-11-20 07:27:57,066 INFO L854 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse0 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_pc~0 0))) (or (and (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) (not (= ~E_M~0 0)) .cse3 .cse4) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse0 .cse1 .cse2 (<= 2 ~T1_E~0) .cse3 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2021-11-20 07:27:57,066 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2021-11-20 07:27:57,066 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2021-11-20 07:27:57,067 INFO L854 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-11-20 07:27:57,067 INFO L854 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-11-20 07:27:57,067 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,067 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2021-11-20 07:27:57,067 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-11-20 07:27:57,068 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2021-11-20 07:27:57,068 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-11-20 07:27:57,068 INFO L854 garLoopResultBuilder]: At program point L970(lines 963 972) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2021-11-20 07:27:57,068 INFO L854 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and (= ~m_pc~0 ~t1_pc~0) .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7))) [2021-11-20 07:27:57,068 INFO L858 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2021-11-20 07:27:57,068 INFO L854 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2021-11-20 07:27:57,069 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,069 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse6 (< 1 ~p_dw_pc~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-11-20 07:27:57,069 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2021-11-20 07:27:57,069 INFO L858 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2021-11-20 07:27:57,069 INFO L854 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,070 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-11-20 07:27:57,070 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,070 INFO L854 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,070 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-11-20 07:27:57,070 INFO L854 garLoopResultBuilder]: At program point L1007-1(lines 1004 1044) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,071 INFO L854 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,071 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2021-11-20 07:27:57,071 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2021-11-20 07:27:57,071 INFO L858 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2021-11-20 07:27:57,071 INFO L854 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse10 (= ~m_st~0 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (not (= ~E_M~0 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse9 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7))) [2021-11-20 07:27:57,072 INFO L854 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,072 INFO L854 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,072 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2021-11-20 07:27:57,072 INFO L858 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2021-11-20 07:27:57,072 INFO L854 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,072 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2021-11-20 07:27:57,073 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 07:27:57,073 INFO L854 garLoopResultBuilder]: At program point L813(lines 789 827) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,073 INFO L854 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse0 .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2021-11-20 07:27:57,073 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2021-11-20 07:27:57,073 INFO L854 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2021-11-20 07:27:57,074 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2021-11-20 07:27:57,074 INFO L854 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (let ((.cse5 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4))) [2021-11-20 07:27:57,074 INFO L861 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2021-11-20 07:27:57,074 INFO L854 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,074 INFO L858 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2021-11-20 07:27:57,075 INFO L854 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,075 INFO L858 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2021-11-20 07:27:57,075 INFO L858 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2021-11-20 07:27:57,075 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2021-11-20 07:27:57,075 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2021-11-20 07:27:57,075 INFO L854 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,076 INFO L858 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2021-11-20 07:27:57,076 INFO L858 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2021-11-20 07:27:57,076 INFO L854 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,076 INFO L858 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2021-11-20 07:27:57,076 INFO L858 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2021-11-20 07:27:57,076 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-11-20 07:27:57,077 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 07:27:57,077 INFO L854 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse4 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~p_dw_pc~0) .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-11-20 07:27:57,077 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2021-11-20 07:27:57,077 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,077 INFO L858 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2021-11-20 07:27:57,077 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-11-20 07:27:57,078 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2021-11-20 07:27:57,078 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-11-20 07:27:57,078 INFO L854 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,078 INFO L854 garLoopResultBuilder]: At program point L754-1(lines 745 762) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 (<= 2 ~E_M~0) .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (not (= ~E_M~0 0)) .cse4 .cse5 .cse6))) [2021-11-20 07:27:57,078 INFO L854 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (and (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse3 .cse4 .cse5) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))))) [2021-11-20 07:27:57,079 INFO L858 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2021-11-20 07:27:57,079 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2021-11-20 07:27:57,079 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2021-11-20 07:27:57,079 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 07:27:57,079 INFO L854 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,080 INFO L854 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,080 INFO L854 garLoopResultBuilder]: At program point L656(lines 619 662) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-20 07:27:57,080 INFO L858 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2021-11-20 07:27:57,080 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= ~c_dr_pc~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-11-20 07:27:57,080 INFO L854 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,081 INFO L854 garLoopResultBuilder]: At program point L954-1(lines 935 962) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,081 INFO L854 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,081 INFO L858 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2021-11-20 07:27:57,081 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse3 (<= 1 ~p_dw_pc~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse8 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse8 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 .cse7 .cse8 .cse4 .cse6))) [2021-11-20 07:27:57,082 INFO L854 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,082 INFO L854 garLoopResultBuilder]: At program point L988(lines 977 990) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,082 INFO L854 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,082 INFO L854 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,083 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (<= 1 ~p_dw_pc~0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse5) (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) .cse6 (< 1 ~p_dw_pc~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2021-11-20 07:27:57,083 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-11-20 07:27:57,083 INFO L854 garLoopResultBuilder]: At program point L989(lines 973 991) the Hoare annotation is: (let ((.cse5 (<= ~t1_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse14 .cse2 .cse12 .cse4 (not (= ~E_M~0 0)) .cse7 .cse8))) [2021-11-20 07:27:57,083 INFO L854 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse0 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0)))) (.cse8 (<= 2 ~E_M~0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~m_st~0 0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) (not (= ~E_M~0 0)) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse10) (and .cse6 .cse7 .cse8 .cse1 .cse11 .cse3 .cse9 (<= (+ ~local~0 1) ~token~0) .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) .cse10) (and .cse6 .cse7 .cse0 .cse8 .cse1 .cse11 .cse3 .cse9 .cse4 .cse5 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2021-11-20 07:27:57,083 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2021-11-20 07:27:57,084 INFO L854 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,084 INFO L854 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,084 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2021-11-20 07:27:57,084 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 07:27:57,084 INFO L858 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2021-11-20 07:27:57,084 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2021-11-20 07:27:57,085 INFO L854 garLoopResultBuilder]: At program point L627(lines 622 661) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))) [2021-11-20 07:27:57,085 INFO L854 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= ~E_M~0 0)) (= ~c_dr_pc~0 0) (= ~M_E~0 2)) [2021-11-20 07:27:57,085 INFO L858 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2021-11-20 07:27:57,085 INFO L858 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-11-20 07:27:57,085 INFO L858 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2021-11-20 07:27:57,085 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2021-11-20 07:27:57,086 INFO L854 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse4 (= ~E_M~0 0)) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (<= 1 ~c_dr_pc~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse4 (not (< 1 ~p_dw_pc~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse2 .cse4 .cse9 .cse6 .cse10 .cse7 (not (<= 1 ~p_dw_pc~0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10 .cse7))) [2021-11-20 07:27:57,086 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-11-20 07:27:57,086 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2021-11-20 07:27:57,086 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2021-11-20 07:27:57,086 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2021-11-20 07:27:57,087 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2021-11-20 07:27:57,087 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-11-20 07:27:57,087 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2021-11-20 07:27:57,087 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2021-11-20 07:27:57,087 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2021-11-20 07:27:57,087 INFO L861 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2021-11-20 07:27:57,087 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2021-11-20 07:27:57,088 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2021-11-20 07:27:57,088 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2021-11-20 07:27:57,088 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2021-11-20 07:27:57,088 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-11-20 07:27:57,088 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-20 07:27:57,088 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-11-20 07:27:57,089 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-11-20 07:27:57,089 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2021-11-20 07:27:57,089 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 763 782) no Hoare annotation was computed. [2021-11-20 07:27:57,089 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2021-11-20 07:27:57,089 INFO L861 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: true [2021-11-20 07:27:57,089 INFO L858 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2021-11-20 07:27:57,089 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2021-11-20 07:27:57,090 INFO L858 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2021-11-20 07:27:57,090 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse4 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (<= 1 ~p_dw_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~E_M~0 0)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse7 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse5 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5 .cse7))) [2021-11-20 07:27:57,090 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2021-11-20 07:27:57,090 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2021-11-20 07:27:57,090 INFO L858 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2021-11-20 07:27:57,091 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2021-11-20 07:27:57,091 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse14 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (<= 2 |old(~T1_E~0)|))) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) .cse8 .cse9 (not (<= (+ ~local~0 1) ~token~0)) .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse0 .cse1 (= |old(~E_M~0)| 0) .cse3 .cse6 .cse8 .cse10 .cse15) (or .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse15))) [2021-11-20 07:27:57,091 INFO L858 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2021-11-20 07:27:57,091 INFO L858 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2021-11-20 07:27:57,091 INFO L858 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2021-11-20 07:27:57,094 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:27:57,096 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:27:57,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:27:57 BoogieIcfgContainer [2021-11-20 07:27:57,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:27:57,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:27:57,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:27:57,174 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:27:57,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:38" (3/4) ... [2021-11-20 07:27:57,178 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 07:27:57,183 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-11-20 07:27:57,184 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-11-20 07:27:57,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-20 07:27:57,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-20 07:27:57,198 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-20 07:27:57,200 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 07:27:57,201 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 07:27:57,227 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) [2021-11-20 07:27:57,228 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) [2021-11-20 07:27:57,230 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) [2021-11-20 07:27:57,231 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) && (((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) [2021-11-20 07:27:57,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:27:57,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:27:57,298 INFO L158 Benchmark]: Toolchain (without parser) took 80664.84ms. Allocated memory was 88.1MB in the beginning and 989.9MB in the end (delta: 901.8MB). Free memory was 51.0MB in the beginning and 371.4MB in the end (delta: -320.4MB). Peak memory consumption was 581.4MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,298 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 67.6MB in the beginning and 67.6MB in the end (delta: 38.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:27:57,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.28ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.9MB in the beginning and 77.2MB in the end (delta: -26.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 107.0MB. Free memory was 77.2MB in the beginning and 74.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,299 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 107.0MB. Free memory was 74.5MB in the beginning and 72.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,299 INFO L158 Benchmark]: RCFGBuilder took 907.16ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 48.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,300 INFO L158 Benchmark]: TraceAbstraction took 78989.44ms. Allocated memory was 107.0MB in the beginning and 989.9MB in the end (delta: 882.9MB). Free memory was 47.6MB in the beginning and 386.5MB in the end (delta: -338.9MB). Peak memory consumption was 579.6MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,300 INFO L158 Benchmark]: Witness Printer took 123.37ms. Allocated memory is still 989.9MB. Free memory was 386.5MB in the beginning and 371.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-20 07:27:57,302 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 67.6MB in the beginning and 67.6MB in the end (delta: 38.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.28ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 50.9MB in the beginning and 77.2MB in the end (delta: -26.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 107.0MB. Free memory was 77.2MB in the beginning and 74.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.90ms. Allocated memory is still 107.0MB. Free memory was 74.5MB in the beginning and 72.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 907.16ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 48.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 78989.44ms. Allocated memory was 107.0MB in the beginning and 989.9MB in the end (delta: 882.9MB). Free memory was 47.6MB in the beginning and 386.5MB in the end (delta: -338.9MB). Peak memory consumption was 579.6MB. Max. memory is 16.1GB. * Witness Printer took 123.37ms. Allocated memory is still 989.9MB. Free memory was 386.5MB in the beginning and 371.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 224 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 78.8s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10830 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10534 mSDsluCounter, 18497 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12081 mSDsCounter, 2584 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9747 IncrementalHoareTripleChecker+Invalid, 12331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2584 mSolverCounterUnsat, 6416 mSDtfsCounter, 9747 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1773 GetRequests, 1483 SyntacticMatches, 3 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2737occurred in iteration=13, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 2362 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 6105 PreInvPairs, 8466 NumberOfFragments, 13340 HoareAnnotationTreeSize, 6105 FomulaSimplifications, 27809 FormulaSimplificationTreeSizeReduction, 22.2s HoareSimplificationTime, 89 FomulaSimplificationsInter, 1005469 FormulaSimplificationTreeSizeReductionInter, 28.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3234 NumberOfCodeBlocks, 3234 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3202 ConstructedInterpolants, 0 QuantifiedInterpolants, 5802 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3454 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1313/1388 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(1 < m_pc) && !(m_pc <= 0))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(c_dr_pc == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || E_M == 0) || !(1 < p_dw_pc)) || !(T1_E == M_E)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_read_ev == 2))) && ((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || c_dr_pc == p_dw_pc) || (__retres1 <= 0 && 0 <= __retres1)) || E_M == 0) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(1 <= p_dw_pc)) || !(q_read_ev == 2))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && M_E == 2 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && ((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && 2 <= E_1) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) && M_E == 2) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) && M_E == 2) - InvariantResult [Line: 926]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) && ((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && !(E_M == 0)) && M_E == 2)) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && !(E_M == 0)) && M_E == 2)) && 1 <= c_dr_pc) && c_dr_pc <= 1) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && 2 <= E_1) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) && M_E == 2 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1004]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 < p_dw_pc) && !(E_M == 0)) && M_E == 2)) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2)) || ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(c_dr_pc == 0)) || E_M == 0) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(1 <= p_dw_pc)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) && (((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1))) && ((((((((((((1 < m_pc || m_pc <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(E_M == 0)) && c_dr_pc == 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(c_dr_pc == p_dw_pc)) || (!(1 < m_pc) && !(m_pc <= 0)))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((!(p_dw_st == 0) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(token < 2 + local)) || !(local + 1 <= token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || ((((((((((m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1))) && ((((((((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(token <= local)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || E_M == 0) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((!(p_dw_st == 0) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || \old(t1_st) == 0) || !(p_dw_pc == 0)) || !(token < 2 + local)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1))) && (((((((((((((!(p_dw_st == 0) || !(M_E == 2)) || !(token <= local)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_dw_pc == 0)) || !(2 <= E_M)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && c_dr_pc == 0) && M_E == 2) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && 1 < p_dw_pc) && !(E_M == 0)) && M_E == 2)) || (((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) || ((((((((((((2 <= E_1 && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0))) || ((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && (1 < m_pc || m_pc <= 0)) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_dr_pc == 0) && token <= local) && local <= token)) || (((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && !(t1_st == 0))) || (((((((1 < m_pc || m_pc <= 0) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= p_dw_pc) && !(E_M == 0)) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && !(E_M == 0)) && M_E == 2)) || ((((((p_dw_pc == 0 && T1_E == M_E) && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && M_E == 2) RESULT: Ultimate proved your program to be correct! [2021-11-20 07:27:57,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2048c7d8-91bf-40c6-962c-c170bbfd3515/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE