./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/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_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:17:42,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:17:42,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:17:42,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:17:42,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:17:42,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:17:42,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:17:42,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:17:42,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:17:42,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:17:42,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:17:42,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:17:42,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:17:42,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:17:42,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:17:42,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:17:42,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:17:42,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:17:42,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:17:42,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:17:42,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:17:42,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:17:42,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:17:42,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:17:42,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:17:42,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:17:42,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:17:42,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:17:42,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:17:42,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:17:42,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:17:42,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:17:42,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:17:42,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:17:42,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:17:42,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:17:42,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:17:42,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:17:42,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:17:42,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:17:42,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:17:42,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:17:42,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:17:42,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:17:42,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:17:42,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:17:42,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:17:42,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:17:42,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:17:42,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:17:42,624 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:17:42,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:17:42,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:17:42,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:17:42,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:17:42,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:17:42,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:17:42,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:17:42,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:17:42,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:17:42,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:17:42,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:17:42,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:17:42,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:17:42,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:17:42,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:17:42,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:17:42,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:17:42,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:17:42,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:17:42,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:17:42,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:17:42,632 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:17:42,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:17:42,633 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:17:42,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:17:42,633 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/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_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R 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 [2022-11-25 17:17:42,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:17:42,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:17:42,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:17:42,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:17:42,969 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:17:42,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-25 17:17:46,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:17:46,336 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:17:46,337 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-25 17:17:46,361 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/data/96e28b39a/5aa85f2e7a334aad96cd8cd93a0fdd8b/FLAG9d9daf496 [2022-11-25 17:17:46,376 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/data/96e28b39a/5aa85f2e7a334aad96cd8cd93a0fdd8b [2022-11-25 17:17:46,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:17:46,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:17:46,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:17:46,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:17:46,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:17:46,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:46,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782d1c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46, skipping insertion in model container [2022-11-25 17:17:46,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:46,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:17:46,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:17:46,669 WARN L237 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_db5e725e-927e-4565-af8a-102698672fae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2022-11-25 17:17:46,773 WARN L237 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_db5e725e-927e-4565-af8a-102698672fae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-11-25 17:17:46,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:17:46,837 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:17:46,853 WARN L237 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_db5e725e-927e-4565-af8a-102698672fae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2022-11-25 17:17:46,906 WARN L237 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_db5e725e-927e-4565-af8a-102698672fae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-11-25 17:17:46,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:17:46,959 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:17:46,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46 WrapperNode [2022-11-25 17:17:46,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:17:46,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:17:46,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:17:46,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:17:46,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:46,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,046 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2022-11-25 17:17:47,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:17:47,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:17:47,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:17:47,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:17:47,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:17:47,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:17:47,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:17:47,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:17:47,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (1/1) ... [2022-11-25 17:17:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:17:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:47,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:17:47,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:17:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:17:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-25 17:17:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-25 17:17:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-25 17:17:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-25 17:17:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-25 17:17:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-25 17:17:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-25 17:17:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-25 17:17:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-25 17:17:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-25 17:17:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-25 17:17:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-25 17:17:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-25 17:17:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-25 17:17:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-25 17:17:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-25 17:17:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-25 17:17:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-25 17:17:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-25 17:17:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-25 17:17:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-25 17:17:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-25 17:17:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:17:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-25 17:17:47,222 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-25 17:17:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-25 17:17:47,222 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-25 17:17:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:17:47,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:17:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-25 17:17:47,224 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-25 17:17:47,338 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:17:47,340 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:17:47,961 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-25 17:17:47,966 INFO L769 $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; [2022-11-25 17:17:48,037 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:17:48,049 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:17:48,054 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-25 17:17:48,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:17:48 BoogieIcfgContainer [2022-11-25 17:17:48,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:17:48,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:17:48,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:17:48,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:17:48,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:17:46" (1/3) ... [2022-11-25 17:17:48,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568a87cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:17:48, skipping insertion in model container [2022-11-25 17:17:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:46" (2/3) ... [2022-11-25 17:17:48,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568a87cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:17:48, skipping insertion in model container [2022-11-25 17:17:48,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:17:48" (3/3) ... [2022-11-25 17:17:48,071 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-25 17:17:48,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:17:48,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:17:48,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:17:48,179 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@527def59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:17:48,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 17:17:48,187 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) [2022-11-25 17:17:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:17:48,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:48,206 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:48,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2022-11-25 17:17:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60151738] [2022-11-25 17:17:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:17:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:17:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:17:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:17:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60151738] [2022-11-25 17:17:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60151738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:48,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:48,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:17:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577863945] [2022-11-25 17:17:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:17:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:17:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:17:48,787 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) [2022-11-25 17:17:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:49,992 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2022-11-25 17:17:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:17:49,994 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 [2022-11-25 17:17:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:50,012 INFO L225 Difference]: With dead ends: 562 [2022-11-25 17:17:50,013 INFO L226 Difference]: Without dead ends: 345 [2022-11-25 17:17:50,017 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:17:50,021 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 564 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:50,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 699 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:17:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-25 17:17:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2022-11-25 17:17:50,141 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) [2022-11-25 17:17:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2022-11-25 17:17:50,149 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2022-11-25 17:17:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:50,151 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2022-11-25 17:17:50,151 INFO L496 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) [2022-11-25 17:17:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2022-11-25 17:17:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:17:50,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:50,164 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:17:50,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2022-11-25 17:17:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:50,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634020423] [2022-11-25 17:17:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:17:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:17:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:17:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:17:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:50,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634020423] [2022-11-25 17:17:50,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634020423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:50,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:17:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649746992] [2022-11-25 17:17:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:50,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:50,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:50,449 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) [2022-11-25 17:17:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:51,479 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2022-11-25 17:17:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:17:51,479 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 [2022-11-25 17:17:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:51,483 INFO L225 Difference]: With dead ends: 636 [2022-11-25 17:17:51,484 INFO L226 Difference]: Without dead ends: 453 [2022-11-25 17:17:51,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:17:51,487 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 545 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:51,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 982 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:17:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-11-25 17:17:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2022-11-25 17:17:51,535 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) [2022-11-25 17:17:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2022-11-25 17:17:51,538 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2022-11-25 17:17:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:51,539 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2022-11-25 17:17:51,539 INFO L496 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) [2022-11-25 17:17:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2022-11-25 17:17:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:17:51,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:51,541 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:51,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:17:51,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2022-11-25 17:17:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039319239] [2022-11-25 17:17:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:17:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:17:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:17:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:17:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:51,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039319239] [2022-11-25 17:17:51,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039319239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:51,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:17:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332383008] [2022-11-25 17:17:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:51,688 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) [2022-11-25 17:17:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:52,820 INFO L93 Difference]: Finished difference Result 972 states and 1371 transitions. [2022-11-25 17:17:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:17:52,821 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 [2022-11-25 17:17:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:52,830 INFO L225 Difference]: With dead ends: 972 [2022-11-25 17:17:52,830 INFO L226 Difference]: Without dead ends: 704 [2022-11-25 17:17:52,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:17:52,836 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 559 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:52,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 970 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:17:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-25 17:17:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 554. [2022-11-25 17:17:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-11-25 17:17:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 778 transitions. [2022-11-25 17:17:52,923 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 778 transitions. Word has length 57 [2022-11-25 17:17:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:52,924 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 778 transitions. [2022-11-25 17:17:52,924 INFO L496 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) [2022-11-25 17:17:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 778 transitions. [2022-11-25 17:17:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:17:52,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:52,929 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:52,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:17:52,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2022-11-25 17:17:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:52,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443498315] [2022-11-25 17:17:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:52,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:17:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:17:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:17:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:17:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443498315] [2022-11-25 17:17:53,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443498315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:53,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:53,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:17:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980989281] [2022-11-25 17:17:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:53,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:53,176 INFO L87 Difference]: Start difference. First operand 554 states and 778 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) [2022-11-25 17:17:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:54,071 INFO L93 Difference]: Finished difference Result 1144 states and 1638 transitions. [2022-11-25 17:17:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:17:54,071 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 [2022-11-25 17:17:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:54,078 INFO L225 Difference]: With dead ends: 1144 [2022-11-25 17:17:54,078 INFO L226 Difference]: Without dead ends: 712 [2022-11-25 17:17:54,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:17:54,089 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 289 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:54,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 928 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:17:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-25 17:17:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 569. [2022-11-25 17:17:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2022-11-25 17:17:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 793 transitions. [2022-11-25 17:17:54,156 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 793 transitions. Word has length 57 [2022-11-25 17:17:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:54,158 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 793 transitions. [2022-11-25 17:17:54,159 INFO L496 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) [2022-11-25 17:17:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 793 transitions. [2022-11-25 17:17:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:17:54,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:54,162 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:54,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:17:54,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2022-11-25 17:17:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560477658] [2022-11-25 17:17:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:17:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:17:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:17:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:17:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:54,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560477658] [2022-11-25 17:17:54,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560477658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:54,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:54,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:17:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813802536] [2022-11-25 17:17:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:54,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:54,411 INFO L87 Difference]: Start difference. First operand 569 states and 793 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) [2022-11-25 17:17:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:56,020 INFO L93 Difference]: Finished difference Result 2430 states and 3520 transitions. [2022-11-25 17:17:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:17:56,022 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 [2022-11-25 17:17:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:56,035 INFO L225 Difference]: With dead ends: 2430 [2022-11-25 17:17:56,035 INFO L226 Difference]: Without dead ends: 1983 [2022-11-25 17:17:56,038 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:17:56,041 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 1112 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:56,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 855 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 17:17:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2022-11-25 17:17:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1728. [2022-11-25 17:17:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1373 states have (on average 1.3765477057538238) internal successors, (1890), 1408 states have internal predecessors, (1890), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2022-11-25 17:17:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2405 transitions. [2022-11-25 17:17:56,222 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2405 transitions. Word has length 57 [2022-11-25 17:17:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:56,223 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 2405 transitions. [2022-11-25 17:17:56,223 INFO L496 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) [2022-11-25 17:17:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2405 transitions. [2022-11-25 17:17:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 17:17:56,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:56,225 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:56,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:17:56,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2022-11-25 17:17:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481512264] [2022-11-25 17:17:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:17:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:17:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:17:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:17:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:17:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 17:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:56,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481512264] [2022-11-25 17:17:56,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481512264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:56,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:56,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:17:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561094190] [2022-11-25 17:17:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:56,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:17:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:17:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:17:56,408 INFO L87 Difference]: Start difference. First operand 1728 states and 2405 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) [2022-11-25 17:17:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:57,496 INFO L93 Difference]: Finished difference Result 1983 states and 2775 transitions. [2022-11-25 17:17:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:17:57,496 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 [2022-11-25 17:17:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:57,506 INFO L225 Difference]: With dead ends: 1983 [2022-11-25 17:17:57,506 INFO L226 Difference]: Without dead ends: 1879 [2022-11-25 17:17:57,508 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:17:57,509 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 474 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:57,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 984 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:17:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-25 17:17:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1840. [2022-11-25 17:17:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1463 states have (on average 1.378673957621326) internal successors, (2017), 1500 states have internal predecessors, (2017), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2022-11-25 17:17:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2563 transitions. [2022-11-25 17:17:57,712 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2563 transitions. Word has length 65 [2022-11-25 17:17:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:57,713 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 2563 transitions. [2022-11-25 17:17:57,713 INFO L496 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) [2022-11-25 17:17:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2563 transitions. [2022-11-25 17:17:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 17:17:57,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:57,715 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:57,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:17:57,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2022-11-25 17:17:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:57,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473471834] [2022-11-25 17:17:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:17:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:17:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:17:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:17:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:17:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 17:17:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:57,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:57,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473471834] [2022-11-25 17:17:57,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473471834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:57,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:57,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:17:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510526599] [2022-11-25 17:17:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:57,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:17:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:17:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:17:57,888 INFO L87 Difference]: Start difference. First operand 1840 states and 2563 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) [2022-11-25 17:17:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:59,190 INFO L93 Difference]: Finished difference Result 2237 states and 3129 transitions. [2022-11-25 17:17:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:17:59,191 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 [2022-11-25 17:17:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:59,201 INFO L225 Difference]: With dead ends: 2237 [2022-11-25 17:17:59,201 INFO L226 Difference]: Without dead ends: 2028 [2022-11-25 17:17:59,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:17:59,204 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 595 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:59,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1283 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:17:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-11-25 17:17:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1952. [2022-11-25 17:17:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1553 states have (on average 1.3799098518995492) internal successors, (2143), 1592 states have internal predecessors, (2143), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2022-11-25 17:17:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2723 transitions. [2022-11-25 17:17:59,402 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2723 transitions. Word has length 65 [2022-11-25 17:17:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:59,403 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2723 transitions. [2022-11-25 17:17:59,403 INFO L496 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) [2022-11-25 17:17:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2723 transitions. [2022-11-25 17:17:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 17:17:59,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:59,405 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:17:59,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:17:59,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2022-11-25 17:17:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:59,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788162228] [2022-11-25 17:17:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:17:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:17:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:17:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:17:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 17:17:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:17:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 17:17:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788162228] [2022-11-25 17:17:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788162228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:59,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:59,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:17:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952582000] [2022-11-25 17:17:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:59,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:59,535 INFO L87 Difference]: Start difference. First operand 1952 states and 2723 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) [2022-11-25 17:18:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:00,505 INFO L93 Difference]: Finished difference Result 2624 states and 3665 transitions. [2022-11-25 17:18:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:18:00,506 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 [2022-11-25 17:18:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:00,518 INFO L225 Difference]: With dead ends: 2624 [2022-11-25 17:18:00,518 INFO L226 Difference]: Without dead ends: 2309 [2022-11-25 17:18:00,521 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:00,522 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 843 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:00,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 769 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:18:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2022-11-25 17:18:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2233. [2022-11-25 17:18:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1779 states have (on average 1.377178189994379) internal successors, (2450), 1822 states have internal predecessors, (2450), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2022-11-25 17:18:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3098 transitions. [2022-11-25 17:18:00,785 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3098 transitions. Word has length 65 [2022-11-25 17:18:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:00,787 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3098 transitions. [2022-11-25 17:18:00,788 INFO L496 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) [2022-11-25 17:18:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3098 transitions. [2022-11-25 17:18:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:18:00,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:00,793 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:00,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:18:00,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2022-11-25 17:18:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939998635] [2022-11-25 17:18:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:18:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 17:18:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939998635] [2022-11-25 17:18:00,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939998635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:00,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:00,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:18:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194329940] [2022-11-25 17:18:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:00,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:18:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:18:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:18:00,963 INFO L87 Difference]: Start difference. First operand 2233 states and 3098 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) [2022-11-25 17:18:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:01,934 INFO L93 Difference]: Finished difference Result 2907 states and 4034 transitions. [2022-11-25 17:18:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:18:01,935 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 [2022-11-25 17:18:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:01,946 INFO L225 Difference]: With dead ends: 2907 [2022-11-25 17:18:01,946 INFO L226 Difference]: Without dead ends: 2311 [2022-11-25 17:18:01,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:18:01,951 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 339 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:01,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1102 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:18:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-11-25 17:18:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2248. [2022-11-25 17:18:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1791 states have (on average 1.3729759910664434) internal successors, (2459), 1834 states have internal predecessors, (2459), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2022-11-25 17:18:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3110 transitions. [2022-11-25 17:18:02,216 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3110 transitions. Word has length 66 [2022-11-25 17:18:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3110 transitions. [2022-11-25 17:18:02,217 INFO L496 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) [2022-11-25 17:18:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3110 transitions. [2022-11-25 17:18:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:18:02,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:02,224 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:02,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:18:02,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2022-11-25 17:18:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:02,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842799096] [2022-11-25 17:18:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:18:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 17:18:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842799096] [2022-11-25 17:18:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842799096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:02,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:02,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:18:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385126895] [2022-11-25 17:18:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:02,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:18:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:18:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:18:02,406 INFO L87 Difference]: Start difference. First operand 2248 states and 3110 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) [2022-11-25 17:18:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:04,949 INFO L93 Difference]: Finished difference Result 4453 states and 6231 transitions. [2022-11-25 17:18:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 17:18:04,950 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 [2022-11-25 17:18:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:04,962 INFO L225 Difference]: With dead ends: 4453 [2022-11-25 17:18:04,963 INFO L226 Difference]: Without dead ends: 2611 [2022-11-25 17:18:04,968 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:04,969 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 1260 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:04,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1639 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-25 17:18:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-25 17:18:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2456. [2022-11-25 17:18:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 1943 states have (on average 1.3602676273803396) internal successors, (2643), 1990 states have internal predecessors, (2643), 296 states have call successors, (296), 184 states have call predecessors, (296), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2022-11-25 17:18:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3373 transitions. [2022-11-25 17:18:05,282 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3373 transitions. Word has length 66 [2022-11-25 17:18:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:05,282 INFO L495 AbstractCegarLoop]: Abstraction has 2456 states and 3373 transitions. [2022-11-25 17:18:05,282 INFO L496 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) [2022-11-25 17:18:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3373 transitions. [2022-11-25 17:18:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 17:18:05,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:05,284 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:18:05,285 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -801093477, now seen corresponding path program 1 times [2022-11-25 17:18:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:05,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532893784] [2022-11-25 17:18:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:18:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:18:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532893784] [2022-11-25 17:18:05,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532893784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:05,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:05,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:18:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445499763] [2022-11-25 17:18:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:18:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:18:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:18:05,437 INFO L87 Difference]: Start difference. First operand 2456 states and 3373 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) [2022-11-25 17:18:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:06,408 INFO L93 Difference]: Finished difference Result 3420 states and 4693 transitions. [2022-11-25 17:18:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:18:06,409 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 [2022-11-25 17:18:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:06,420 INFO L225 Difference]: With dead ends: 3420 [2022-11-25 17:18:06,421 INFO L226 Difference]: Without dead ends: 2601 [2022-11-25 17:18:06,424 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:06,424 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 333 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:06,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1058 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:18:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-11-25 17:18:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2501. [2022-11-25 17:18:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 1979 states have (on average 1.3537139969681657) internal successors, (2679), 2026 states have internal predecessors, (2679), 296 states have call successors, (296), 184 states have call predecessors, (296), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2022-11-25 17:18:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3418 transitions. [2022-11-25 17:18:06,738 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3418 transitions. Word has length 67 [2022-11-25 17:18:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:06,739 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3418 transitions. [2022-11-25 17:18:06,739 INFO L496 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) [2022-11-25 17:18:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3418 transitions. [2022-11-25 17:18:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 17:18:06,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:06,742 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:06,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:18:06,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 585109917, now seen corresponding path program 1 times [2022-11-25 17:18:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749144350] [2022-11-25 17:18:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:18:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:18:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:06,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749144350] [2022-11-25 17:18:06,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749144350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:06,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:06,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:18:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086078105] [2022-11-25 17:18:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:06,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:18:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:18:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:06,928 INFO L87 Difference]: Start difference. First operand 2501 states and 3418 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) [2022-11-25 17:18:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:08,210 INFO L93 Difference]: Finished difference Result 3481 states and 4721 transitions. [2022-11-25 17:18:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:18:08,211 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 [2022-11-25 17:18:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:08,223 INFO L225 Difference]: With dead ends: 3481 [2022-11-25 17:18:08,224 INFO L226 Difference]: Without dead ends: 2704 [2022-11-25 17:18:08,226 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:08,227 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 610 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:08,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 883 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:18:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2022-11-25 17:18:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2510. [2022-11-25 17:18:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 1988 states have (on average 1.3511066398390341) internal successors, (2686), 2033 states have internal predecessors, (2686), 297 states have call successors, (297), 185 states have call predecessors, (297), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2022-11-25 17:18:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3422 transitions. [2022-11-25 17:18:08,498 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3422 transitions. Word has length 67 [2022-11-25 17:18:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:08,498 INFO L495 AbstractCegarLoop]: Abstraction has 2510 states and 3422 transitions. [2022-11-25 17:18:08,498 INFO L496 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) [2022-11-25 17:18:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3422 transitions. [2022-11-25 17:18:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 17:18:08,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:08,501 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:08,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:18:08,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 451096411, now seen corresponding path program 1 times [2022-11-25 17:18:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519713207] [2022-11-25 17:18:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:18:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:18:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:08,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519713207] [2022-11-25 17:18:08,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519713207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:08,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:08,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:18:08,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499849919] [2022-11-25 17:18:08,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:08,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:18:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:18:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:18:08,602 INFO L87 Difference]: Start difference. First operand 2510 states and 3422 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) [2022-11-25 17:18:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:09,539 INFO L93 Difference]: Finished difference Result 4395 states and 5944 transitions. [2022-11-25 17:18:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:18:09,540 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 [2022-11-25 17:18:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:09,558 INFO L225 Difference]: With dead ends: 4395 [2022-11-25 17:18:09,558 INFO L226 Difference]: Without dead ends: 3525 [2022-11-25 17:18:09,562 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:09,564 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 561 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:09,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 726 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:18:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-11-25 17:18:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3359. [2022-11-25 17:18:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2642 states have (on average 1.330431491294474) internal successors, (3515), 2700 states have internal predecessors, (3515), 401 states have call successors, (401), 249 states have call predecessors, (401), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2022-11-25 17:18:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4545 transitions. [2022-11-25 17:18:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4545 transitions. Word has length 67 [2022-11-25 17:18:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:10,084 INFO L495 AbstractCegarLoop]: Abstraction has 3359 states and 4545 transitions. [2022-11-25 17:18:10,085 INFO L496 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) [2022-11-25 17:18:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4545 transitions. [2022-11-25 17:18:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 17:18:10,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:10,088 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:10,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:18:10,088 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 678625623, now seen corresponding path program 1 times [2022-11-25 17:18:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200604308] [2022-11-25 17:18:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 17:18:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:18:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:18:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:18:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 17:18:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:18:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:10,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200604308] [2022-11-25 17:18:10,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200604308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:10,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:10,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:18:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757025] [2022-11-25 17:18:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:10,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:18:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:10,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:18:10,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:18:10,169 INFO L87 Difference]: Start difference. First operand 3359 states and 4545 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) [2022-11-25 17:18:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:10,958 INFO L93 Difference]: Finished difference Result 5082 states and 6901 transitions. [2022-11-25 17:18:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:18:10,959 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 [2022-11-25 17:18:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:10,967 INFO L225 Difference]: With dead ends: 5082 [2022-11-25 17:18:10,967 INFO L226 Difference]: Without dead ends: 1617 [2022-11-25 17:18:10,975 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:10,976 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 441 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:10,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 522 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:18:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2022-11-25 17:18:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2022-11-25 17:18:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1286 states have (on average 1.3709175738724728) internal successors, (1763), 1318 states have internal predecessors, (1763), 194 states have call successors, (194), 120 states have call predecessors, (194), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2022-11-25 17:18:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2248 transitions. [2022-11-25 17:18:11,164 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2248 transitions. Word has length 68 [2022-11-25 17:18:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:11,164 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2248 transitions. [2022-11-25 17:18:11,165 INFO L496 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) [2022-11-25 17:18:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2248 transitions. [2022-11-25 17:18:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 17:18:11,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:11,168 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:11,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:18:11,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1894779564, now seen corresponding path program 1 times [2022-11-25 17:18:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493833101] [2022-11-25 17:18:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:18:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 17:18:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 17:18:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493833101] [2022-11-25 17:18:11,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493833101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180986250] [2022-11-25 17:18:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:11,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:11,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:18:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:11,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:18:11,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:18:11,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:11,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180986250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:11,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:11,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-25 17:18:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795219106] [2022-11-25 17:18:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:11,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:11,508 INFO L87 Difference]: Start difference. First operand 1617 states and 2248 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) [2022-11-25 17:18:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:11,862 INFO L93 Difference]: Finished difference Result 4659 states and 6517 transitions. [2022-11-25 17:18:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:11,863 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 [2022-11-25 17:18:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:11,883 INFO L225 Difference]: With dead ends: 4659 [2022-11-25 17:18:11,884 INFO L226 Difference]: Without dead ends: 2010 [2022-11-25 17:18:11,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:11,895 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 394 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 [2022-11-25 17:18:11,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 394 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-11-25 17:18:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 2010. [2022-11-25 17:18:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1605 states have (on average 1.3651090342679129) internal successors, (2191), 1641 states have internal predecessors, (2191), 236 states have call successors, (236), 148 states have call predecessors, (236), 168 states have return successors, (355), 224 states have call predecessors, (355), 236 states have call successors, (355) [2022-11-25 17:18:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2782 transitions. [2022-11-25 17:18:12,149 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2782 transitions. Word has length 92 [2022-11-25 17:18:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:12,150 INFO L495 AbstractCegarLoop]: Abstraction has 2010 states and 2782 transitions. [2022-11-25 17:18:12,150 INFO L496 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) [2022-11-25 17:18:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2782 transitions. [2022-11-25 17:18:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-25 17:18:12,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:12,154 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:12,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:18:12,360 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1224402848, now seen corresponding path program 1 times [2022-11-25 17:18:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950214151] [2022-11-25 17:18:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 17:18:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 17:18:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-25 17:18:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-25 17:18:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:12,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950214151] [2022-11-25 17:18:12,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950214151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276267954] [2022-11-25 17:18:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:12,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:12,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:18:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:12,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:18:12,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 17:18:12,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:12,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276267954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:12,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:12,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-25 17:18:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126350134] [2022-11-25 17:18:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:12,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:12,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:12,780 INFO L87 Difference]: Start difference. First operand 2010 states and 2782 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) [2022-11-25 17:18:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:13,117 INFO L93 Difference]: Finished difference Result 4810 states and 6721 transitions. [2022-11-25 17:18:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:13,118 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 [2022-11-25 17:18:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:13,131 INFO L225 Difference]: With dead ends: 4810 [2022-11-25 17:18:13,132 INFO L226 Difference]: Without dead ends: 3192 [2022-11-25 17:18:13,137 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:13,138 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 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 [2022-11-25 17:18:13,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2022-11-25 17:18:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3150. [2022-11-25 17:18:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2520 states have (on average 1.3615079365079366) internal successors, (3431), 2573 states have internal predecessors, (3431), 364 states have call successors, (364), 233 states have call predecessors, (364), 265 states have return successors, (535), 347 states have call predecessors, (535), 364 states have call successors, (535) [2022-11-25 17:18:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4330 transitions. [2022-11-25 17:18:13,513 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4330 transitions. Word has length 118 [2022-11-25 17:18:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:13,514 INFO L495 AbstractCegarLoop]: Abstraction has 3150 states and 4330 transitions. [2022-11-25 17:18:13,514 INFO L496 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) [2022-11-25 17:18:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4330 transitions. [2022-11-25 17:18:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 17:18:13,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:13,519 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:13,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:13,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:18:13,727 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:13,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1746596599, now seen corresponding path program 1 times [2022-11-25 17:18:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:13,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905206147] [2022-11-25 17:18:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 17:18:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:18:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 17:18:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:18:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-25 17:18:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:13,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905206147] [2022-11-25 17:18:13,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905206147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:13,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291948538] [2022-11-25 17:18:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:13,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:13,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:18:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:13,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:18:13,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 17:18:14,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:14,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291948538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:14,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:14,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-25 17:18:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031912763] [2022-11-25 17:18:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:14,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:14,031 INFO L87 Difference]: Start difference. First operand 3150 states and 4330 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) [2022-11-25 17:18:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:14,570 INFO L93 Difference]: Finished difference Result 6784 states and 9406 transitions. [2022-11-25 17:18:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:14,570 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 [2022-11-25 17:18:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:14,585 INFO L225 Difference]: With dead ends: 6784 [2022-11-25 17:18:14,585 INFO L226 Difference]: Without dead ends: 3644 [2022-11-25 17:18:14,593 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:14,594 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 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 [2022-11-25 17:18:14,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2022-11-25 17:18:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3534. [2022-11-25 17:18:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 2879 states have (on average 1.2910732893365753) internal successors, (3717), 2927 states have internal predecessors, (3717), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2022-11-25 17:18:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 4594 transitions. [2022-11-25 17:18:15,054 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 4594 transitions. Word has length 134 [2022-11-25 17:18:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:15,054 INFO L495 AbstractCegarLoop]: Abstraction has 3534 states and 4594 transitions. [2022-11-25 17:18:15,054 INFO L496 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) [2022-11-25 17:18:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 4594 transitions. [2022-11-25 17:18:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 17:18:15,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:15,060 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:15,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:15,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:18:15,266 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1255738600, now seen corresponding path program 1 times [2022-11-25 17:18:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:15,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129604740] [2022-11-25 17:18:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 17:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:18:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 17:18:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 17:18:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-25 17:18:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:15,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129604740] [2022-11-25 17:18:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129604740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871365167] [2022-11-25 17:18:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:15,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:15,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:15,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:15,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:18:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:15,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:18:15,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 17:18:15,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871365167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-25 17:18:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919739616] [2022-11-25 17:18:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:15,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:15,547 INFO L87 Difference]: Start difference. First operand 3534 states and 4594 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) [2022-11-25 17:18:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:15,991 INFO L93 Difference]: Finished difference Result 7141 states and 9333 transitions. [2022-11-25 17:18:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:15,992 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 [2022-11-25 17:18:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:16,004 INFO L225 Difference]: With dead ends: 7141 [2022-11-25 17:18:16,005 INFO L226 Difference]: Without dead ends: 3619 [2022-11-25 17:18:16,013 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:16,014 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 119 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 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 [2022-11-25 17:18:16,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-11-25 17:18:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3504. [2022-11-25 17:18:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 2849 states have (on average 1.2625482625482625) internal successors, (3597), 2897 states have internal predecessors, (3597), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2022-11-25 17:18:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 4474 transitions. [2022-11-25 17:18:16,476 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 4474 transitions. Word has length 134 [2022-11-25 17:18:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:16,477 INFO L495 AbstractCegarLoop]: Abstraction has 3504 states and 4474 transitions. [2022-11-25 17:18:16,477 INFO L496 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) [2022-11-25 17:18:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4474 transitions. [2022-11-25 17:18:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-25 17:18:16,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:16,484 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:16,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:16,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:18:16,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash 429240706, now seen corresponding path program 1 times [2022-11-25 17:18:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:16,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486700452] [2022-11-25 17:18:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:16,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 17:18:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-25 17:18:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:16,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486700452] [2022-11-25 17:18:16,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486700452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:16,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328074492] [2022-11-25 17:18:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:16,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:16,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:16,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:16,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:18:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:16,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:18:16,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:18:17,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:17,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328074492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:17,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:17,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-25 17:18:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694178404] [2022-11-25 17:18:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:17,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:18:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:18:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:17,033 INFO L87 Difference]: Start difference. First operand 3504 states and 4474 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) [2022-11-25 17:18:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:17,466 INFO L93 Difference]: Finished difference Result 4980 states and 6464 transitions. [2022-11-25 17:18:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:18:17,467 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 [2022-11-25 17:18:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:17,481 INFO L225 Difference]: With dead ends: 4980 [2022-11-25 17:18:17,481 INFO L226 Difference]: Without dead ends: 3223 [2022-11-25 17:18:17,486 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:17,487 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 368 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 [2022-11-25 17:18:17,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2022-11-25 17:18:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3161. [2022-11-25 17:18:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2574 states have (on average 1.2424242424242424) internal successors, (3198), 2618 states have internal predecessors, (3198), 324 states have call successors, (324), 234 states have call predecessors, (324), 262 states have return successors, (453), 312 states have call predecessors, (453), 324 states have call successors, (453) [2022-11-25 17:18:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 3975 transitions. [2022-11-25 17:18:17,969 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 3975 transitions. Word has length 135 [2022-11-25 17:18:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:17,970 INFO L495 AbstractCegarLoop]: Abstraction has 3161 states and 3975 transitions. [2022-11-25 17:18:17,970 INFO L496 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) [2022-11-25 17:18:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3975 transitions. [2022-11-25 17:18:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-25 17:18:17,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:17,978 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:17,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:18,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:18,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1638887588, now seen corresponding path program 1 times [2022-11-25 17:18:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:18,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886331227] [2022-11-25 17:18:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:18:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-25 17:18:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:18,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886331227] [2022-11-25 17:18:18,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886331227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:18,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311426755] [2022-11-25 17:18:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:18,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:18,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:18,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:18:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:18,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:18:18,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:18:18,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:18,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311426755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:18,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:18,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-25 17:18:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198544835] [2022-11-25 17:18:18,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:18:18,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:18:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:18:18,602 INFO L87 Difference]: Start difference. First operand 3161 states and 3975 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) [2022-11-25 17:18:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:19,262 INFO L93 Difference]: Finished difference Result 4497 states and 5708 transitions. [2022-11-25 17:18:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:18:19,263 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 [2022-11-25 17:18:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:19,271 INFO L225 Difference]: With dead ends: 4497 [2022-11-25 17:18:19,271 INFO L226 Difference]: Without dead ends: 2539 [2022-11-25 17:18:19,276 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:19,277 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:19,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 226 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:18:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2022-11-25 17:18:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2518. [2022-11-25 17:18:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2049 states have (on average 1.208882381649585) internal successors, (2477), 2076 states have internal predecessors, (2477), 265 states have call successors, (265), 189 states have call predecessors, (265), 203 states have return successors, (335), 254 states have call predecessors, (335), 265 states have call successors, (335) [2022-11-25 17:18:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3077 transitions. [2022-11-25 17:18:19,653 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3077 transitions. Word has length 136 [2022-11-25 17:18:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:19,654 INFO L495 AbstractCegarLoop]: Abstraction has 2518 states and 3077 transitions. [2022-11-25 17:18:19,654 INFO L496 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) [2022-11-25 17:18:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3077 transitions. [2022-11-25 17:18:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-25 17:18:19,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:19,658 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:19,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 17:18:19,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:19,874 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash 331745190, now seen corresponding path program 1 times [2022-11-25 17:18:19,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:19,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471782982] [2022-11-25 17:18:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:18:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-25 17:18:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:20,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471782982] [2022-11-25 17:18:20,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471782982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:20,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616681384] [2022-11-25 17:18:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:20,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:20,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:18:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:20,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:18:20,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:18:20,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:20,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616681384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:20,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:20,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-25 17:18:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550189881] [2022-11-25 17:18:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:18:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:18:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:18:20,314 INFO L87 Difference]: Start difference. First operand 2518 states and 3077 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) [2022-11-25 17:18:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:20,731 INFO L93 Difference]: Finished difference Result 4137 states and 5073 transitions. [2022-11-25 17:18:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:18:20,732 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 [2022-11-25 17:18:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:20,737 INFO L225 Difference]: With dead ends: 4137 [2022-11-25 17:18:20,737 INFO L226 Difference]: Without dead ends: 1712 [2022-11-25 17:18:20,743 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:20,743 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 156 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:20,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 220 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:18:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-25 17:18:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1198. [2022-11-25 17:18:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 983 states have (on average 1.1525940996948119) internal successors, (1133), 994 states have internal predecessors, (1133), 119 states have call successors, (119), 86 states have call predecessors, (119), 95 states have return successors, (143), 118 states have call predecessors, (143), 119 states have call successors, (143) [2022-11-25 17:18:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1395 transitions. [2022-11-25 17:18:20,925 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1395 transitions. Word has length 136 [2022-11-25 17:18:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:20,926 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 1395 transitions. [2022-11-25 17:18:20,926 INFO L496 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) [2022-11-25 17:18:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1395 transitions. [2022-11-25 17:18:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-25 17:18:20,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:20,929 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:20,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 17:18:21,135 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2065725340, now seen corresponding path program 1 times [2022-11-25 17:18:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265943572] [2022-11-25 17:18:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:18:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-25 17:18:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265943572] [2022-11-25 17:18:21,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265943572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:18:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504020774] [2022-11-25 17:18:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:21,281 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:21,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:18:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:21,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:18:21,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-25 17:18:21,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:21,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504020774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:21,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:18:21,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-25 17:18:21,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972662843] [2022-11-25 17:18:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:21,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:18:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:18:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:18:21,450 INFO L87 Difference]: Start difference. First operand 1198 states and 1395 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) [2022-11-25 17:18:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:21,724 INFO L93 Difference]: Finished difference Result 2420 states and 2882 transitions. [2022-11-25 17:18:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:18:21,725 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 [2022-11-25 17:18:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:21,729 INFO L225 Difference]: With dead ends: 2420 [2022-11-25 17:18:21,729 INFO L226 Difference]: Without dead ends: 1233 [2022-11-25 17:18:21,733 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:21,734 INFO L413 NwaCegarLoop]: 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 [2022-11-25 17:18:21,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-11-25 17:18:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1213. [2022-11-25 17:18:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 998 states have (on average 1.128256513026052) internal successors, (1126), 1009 states have internal predecessors, (1126), 119 states have call successors, (119), 86 states have call predecessors, (119), 95 states have return successors, (143), 118 states have call predecessors, (143), 119 states have call successors, (143) [2022-11-25 17:18:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1388 transitions. [2022-11-25 17:18:21,964 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1388 transitions. Word has length 136 [2022-11-25 17:18:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:21,965 INFO L495 AbstractCegarLoop]: Abstraction has 1213 states and 1388 transitions. [2022-11-25 17:18:21,965 INFO L496 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) [2022-11-25 17:18:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1388 transitions. [2022-11-25 17:18:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-25 17:18:21,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:21,968 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:21,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:22,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:22,174 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1471946848, now seen corresponding path program 1 times [2022-11-25 17:18:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:22,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461311426] [2022-11-25 17:18:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:18:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-25 17:18:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461311426] [2022-11-25 17:18:22,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461311426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:22,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:22,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:18:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930866501] [2022-11-25 17:18:22,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:22,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:18:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:18:22,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:18:22,313 INFO L87 Difference]: Start difference. First operand 1213 states and 1388 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) [2022-11-25 17:18:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:23,103 INFO L93 Difference]: Finished difference Result 2192 states and 2489 transitions. [2022-11-25 17:18:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:18:23,103 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 [2022-11-25 17:18:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:23,110 INFO L225 Difference]: With dead ends: 2192 [2022-11-25 17:18:23,110 INFO L226 Difference]: Without dead ends: 2190 [2022-11-25 17:18:23,111 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:23,112 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 483 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:23,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 437 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:18:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2022-11-25 17:18:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1917. [2022-11-25 17:18:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1578 states have (on average 1.1254752851711027) internal successors, (1776), 1595 states have internal predecessors, (1776), 187 states have call successors, (187), 134 states have call predecessors, (187), 151 states have return successors, (222), 188 states have call predecessors, (222), 187 states have call successors, (222) [2022-11-25 17:18:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2185 transitions. [2022-11-25 17:18:23,424 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2185 transitions. Word has length 136 [2022-11-25 17:18:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:23,424 INFO L495 AbstractCegarLoop]: Abstraction has 1917 states and 2185 transitions. [2022-11-25 17:18:23,424 INFO L496 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) [2022-11-25 17:18:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2185 transitions. [2022-11-25 17:18:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-25 17:18:23,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:23,429 INFO L195 NwaCegarLoop]: 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] [2022-11-25 17:18:23,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:18:23,429 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -609020054, now seen corresponding path program 2 times [2022-11-25 17:18:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:23,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142642502] [2022-11-25 17:18:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:18:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:18:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 17:18:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 17:18:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:18:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:18:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 17:18:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:18:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 17:18:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-25 17:18:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 17:18:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-25 17:18:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-25 17:18:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:23,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142642502] [2022-11-25 17:18:23,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142642502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:23,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:23,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:18:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368149078] [2022-11-25 17:18:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:23,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:18:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:18:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:18:23,575 INFO L87 Difference]: Start difference. First operand 1917 states and 2185 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) [2022-11-25 17:18:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:24,541 INFO L93 Difference]: Finished difference Result 3880 states and 4434 transitions. [2022-11-25 17:18:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:18:24,542 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 [2022-11-25 17:18:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:24,543 INFO L225 Difference]: With dead ends: 3880 [2022-11-25 17:18:24,543 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:18:24,548 INFO L412 NwaCegarLoop]: 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 [2022-11-25 17:18:24,549 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 587 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:24,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 385 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:18:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:18:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:18:24,550 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) [2022-11-25 17:18:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:18:24,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2022-11-25 17:18:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:24,551 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:18:24,551 INFO L496 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) [2022-11-25 17:18:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:18:24,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:18:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-25 17:18:24,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-25 17:18:24,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:18:24,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:19:27,977 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2022-11-25 17:19:27,978 INFO L895 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))) (.cse12 (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))) (.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) (let ((.cse11 (<= ~m_pc~0 0))) (or .cse0 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse11)) .cse12 .cse3 .cse5 .cse7 .cse10 (and (not (<= 1 ~t1_pc~0)) .cse11))) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (< ~token~0 (+ 2 ~local~0))) (not (<= (+ ~local~0 1) ~token~0)) .cse10 (not (<= 2 ~E_1~0))))) [2022-11-25 17:19:27,978 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2022-11-25 17:19:27,978 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-11-25 17:19:27,979 INFO L902 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: true [2022-11-25 17:19:27,979 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) 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 (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (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)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse5 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 0)) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse9))) [2022-11-25 17:19:27,979 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2022-11-25 17:19:27,979 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2022-11-25 17:19:27,979 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2022-11-25 17:19:27,980 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2022-11-25 17:19:27,980 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2022-11-25 17:19:27,980 INFO L899 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2022-11-25 17:19:27,980 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse15 (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))) (.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 .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 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10) (or .cse0 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse4 .cse6 .cse7 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse13 .cse14 .cse10 .cse11))) [2022-11-25 17:19:27,981 INFO L895 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse31 (= ~p_dw_st~0 0)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse30 (<= ~m_pc~0 0)) (.cse29 (<= ~m_pc~0 1)) (.cse23 (= ~M_E~0 2))) (let ((.cse18 (not .cse23)) (.cse4 (not (<= ~t1_pc~0 0))) (.cse22 (= ~T1_E~0 ~M_E~0)) (.cse17 (and (not .cse30) .cse29)) (.cse1 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 ~E_M~0))) (.cse20 (and .cse25 .cse26)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse24 (not (= |old(~m_st~0)| 0))) (.cse0 (not .cse31)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse15 (not (= ~t1_pc~0 1))) (.cse3 (not .cse27)) (.cse16 (= |old(~t1_st~0)| 0)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse19 (not (< ~token~0 (+ 2 ~local~0)))) (.cse21 (not (<= (+ ~local~0 1) ~token~0))) (.cse8 (not .cse28)) (.cse9 (and .cse13 .cse14 .cse25 .cse26)) (.cse11 (not (<= 2 ~E_1~0))) (.cse12 (and .cse13 .cse27 .cse14 (<= 2 ~m_st~0) .cse28 (or (not .cse29) .cse30) .cse31 (= ~c_dr_pc~0 0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse1 .cse2 (and .cse13 .cse14) .cse15 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse17 .cse10 .cse3 .cse5 .cse8 .cse12) (or .cse0 .cse18 .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse20 .cse21 .cse8 (and .cse22 .cse23) .cse11) (or .cse0 .cse1 .cse10 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse18 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 (and .cse22 (= ~E_M~0 ~M_E~0) .cse23) .cse11) (or .cse0 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse6 .cse21 .cse8 .cse9 .cse24 .cse11) (or .cse0 .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse0 .cse17 .cse1 .cse2 .cse15 .cse3 .cse16 .cse5 .cse6 .cse20 .cse7 .cse8 .cse24 .cse11) (or .cse0 (and (= ~m_st~0 0) .cse25 .cse26 (not (= ~t1_st~0 0))) .cse10 .cse2 .cse15 .cse3 .cse16 .cse5 .cse19 .cse21 .cse8 .cse9 .cse11 .cse12)))) [2022-11-25 17:19:27,981 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2022-11-25 17:19:27,982 INFO L895 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse16 (not (< ~token~0 (+ 2 ~local~0)))) (.cse17 (not (<= (+ ~local~0 1) ~token~0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse14 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse15 (<= |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 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse3 .cse4 (and .cse14 .cse15) .cse12 .cse5 .cse13 .cse7 .cse16 .cse17 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse12 .cse5 .cse13 .cse7 .cse16 .cse8 .cse17 .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)))) [2022-11-25 17:19:27,982 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2022-11-25 17:19:27,983 INFO L895 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse9 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse10 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse11 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse12 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse19 (= ~M_E~0 2)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse33 (<= ~m_pc~0 1)) (.cse32 (<= ~m_pc~0 0)) (.cse31 (= ~p_dw_st~0 0))) (let ((.cse16 (and .cse25 .cse30 .cse26 (<= 2 ~m_st~0) .cse29 (or (not .cse33) .cse32) .cse31 (= ~c_dr_pc~0 0))) (.cse17 (not .cse19)) (.cse1 (not (<= 2 |old(~m_st~0)|))) (.cse18 (= ~T1_E~0 ~M_E~0)) (.cse22 (not (<= ~t1_pc~0 0))) (.cse27 (and (not .cse32) .cse33)) (.cse21 (not (<= ~token~0 ~local~0))) (.cse24 (not (<= ~local~0 ~token~0))) (.cse20 (and .cse9 .cse10 .cse11 .cse12)) (.cse0 (not .cse31)) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not .cse30)) (.cse5 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (< ~token~0 (+ 2 ~local~0)))) (.cse23 (not (<= 2 ~E_M~0))) (.cse8 (not (<= (+ ~local~0 1) ~token~0))) (.cse13 (not .cse29)) (.cse28 (not (= |old(~m_st~0)| 0))) (.cse14 (and .cse25 .cse26 .cse9 .cse10 .cse11 .cse12)) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= ~m_st~0 0) .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 (and .cse18 .cse19) .cse15 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse2 (and .cse25 .cse26) .cse3 .cse4 .cse5 .cse6 .cse23 .cse24 .cse13) (or .cse0 .cse27 .cse1 .cse4 .cse6 .cse13 .cse16) (or .cse0 .cse21 .cse1 .cse2 .cse3 .cse4 .cse6 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse21 .cse1 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 (and .cse18 (= ~E_M~0 ~M_E~0) .cse19) .cse15 .cse20) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse21 .cse2 .cse4 .cse22 .cse6 .cse23 .cse24 .cse13 .cse14) (or .cse0 .cse27 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse24 .cse13 .cse28 .cse15 .cse20) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse13 .cse28 .cse14 .cse15)))) [2022-11-25 17:19:27,983 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2022-11-25 17:19:27,983 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2022-11-25 17:19:27,983 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2022-11-25 17:19:27,983 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2022-11-25 17:19:27,984 INFO L895 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 ((.cse1 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse14 (not (< ~token~0 (+ 2 ~local~0)))) (.cse15 (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 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse5 .cse7 .cse10) (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 .cse14 .cse15 .cse10 .cse11)))) [2022-11-25 17:19:27,984 INFO L899 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2022-11-25 17:19:27,984 INFO L899 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2022-11-25 17:19:27,984 INFO L899 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2022-11-25 17:19:27,985 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (let ((.cse5 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse6 .cse8))) [2022-11-25 17:19:27,985 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-11-25 17:19:27,985 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2022-11-25 17:19:27,985 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-11-25 17:19:27,985 INFO L899 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2022-11-25 17:19:27,985 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-11-25 17:19:27,986 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse5 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse6 .cse8))) [2022-11-25 17:19:27,986 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~c_dr_pc~0 0))) (.cse9 (and .cse12 .cse4 (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse8 (and .cse12 .cse4)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse11 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (not (<= ~c_dr_pc~0 1))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (<= 1 ~p_dw_pc~0))) (.cse13 (not (= ~q_read_ev~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~p_dw_st~0)| 0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse9 .cse5 .cse10 (not .cse11) .cse6) (or .cse12 .cse0 .cse1 (<= ~p_dw_pc~0 1) .cse2 .cse3 .cse5 .cse6 .cse13) (or .cse0 .cse1 .cse2 .cse9 .cse5 .cse10 .cse14 .cse6 .cse15) (or .cse0 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6 .cse15 .cse7 .cse13)))) [2022-11-25 17:19:27,986 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-11-25 17:19:27,987 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2022-11-25 17:19:27,987 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2022-11-25 17:19:27,987 INFO L899 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2022-11-25 17:19:27,987 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.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)))) (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 .cse0 .cse1 .cse14 .cse3 .cse6 .cse8 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse1 .cse14 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11))) [2022-11-25 17:19:27,987 INFO L899 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2022-11-25 17:19:27,988 INFO L899 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2022-11-25 17:19:27,988 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2022-11-25 17:19:27,988 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2022-11-25 17:19:27,988 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse9))) [2022-11-25 17:19:27,988 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2022-11-25 17:19:27,989 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-11-25 17:19:27,989 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2022-11-25 17:19:27,989 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2022-11-25 17:19:27,989 INFO L895 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 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~T1_E~0 ~M_E~0))) (.cse5 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)))) (and (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse4 .cse5 (not (<= 1 ~p_dw_pc~0))) (or .cse0 .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4 .cse5))) [2022-11-25 17:19:27,989 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-11-25 17:19:27,990 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2022-11-25 17:19:27,991 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:27,991 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-25 17:19:27,991 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-11-25 17:19:27,991 INFO L902 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: true [2022-11-25 17:19:27,992 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:27,992 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-11-25 17:19:27,992 INFO L899 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-11-25 17:19:27,992 INFO L895 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2022-11-25 17:19:27,992 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2022-11-25 17:19:27,993 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:27,993 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2022-11-25 17:19:27,993 INFO L899 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2022-11-25 17:19:27,993 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2022-11-25 17:19:27,993 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5))))) (or (and .cse0 (= ~c_dr_pc~0 0)) (and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse0))) [2022-11-25 17:19:27,994 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:27,994 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-11-25 17:19:27,994 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-25 17:19:27,994 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2022-11-25 17:19:27,994 INFO L895 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (= ~M_E~0 2) [2022-11-25 17:19:27,995 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:27,995 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2022-11-25 17:19:27,995 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-11-25 17:19:27,995 INFO L895 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) (= ~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) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2022-11-25 17:19:27,995 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L895 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: (= ~M_E~0 2) [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L895 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (let ((.cse0 (<= ~m_pc~0 0))) (and (or (<= 1 ~t1_pc~0) (not .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse0))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse1 .cse2 .cse3 (<= 2 ~T1_E~0) .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)))) [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2022-11-25 17:19:27,996 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-11-25 17:19:27,997 INFO L895 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 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-11-25 17:19:27,997 INFO L895 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 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-11-25 17:19:27,997 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:27,997 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-11-25 17:19:27,997 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-11-25 17:19:27,998 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2022-11-25 17:19:27,998 INFO L895 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 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-11-25 17:19:27,998 INFO L895 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) (= ~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) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~M_E~0 2)) [2022-11-25 17:19:27,998 INFO L895 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))) [2022-11-25 17:19:27,998 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2022-11-25 17:19:27,999 INFO L895 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2022-11-25 17:19:27,999 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:27,999 INFO L895 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= 1 ~c_dr_pc~0) .cse6 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-11-25 17:19:27,999 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2022-11-25 17:19:27,999 INFO L899 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2022-11-25 17:19:28,000 INFO L895 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,000 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2022-11-25 17:19:28,000 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,000 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,000 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-11-25 17:19:28,000 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,001 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,001 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-11-25 17:19:28,001 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2022-11-25 17:19:28,001 INFO L899 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2022-11-25 17:19:28,001 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~t1_st~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)) (.cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~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 .cse1 .cse2 .cse9 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse2 .cse3 .cse4 .cse10 .cse6 .cse7))) [2022-11-25 17:19:28,001 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,001 INFO L895 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,002 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-11-25 17:19:28,002 INFO L899 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2022-11-25 17:19:28,002 INFO L895 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,002 INFO L899 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2022-11-25 17:19:28,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:19:28,002 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,003 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.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)) (.cse8 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse6 .cse7 (< ~token~0 (+ 2 ~local~0)) .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)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse6 .cse7 .cse8))) [2022-11-25 17:19:28,003 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-11-25 17:19:28,003 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-11-25 17:19:28,003 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-25 17:19:28,003 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and .cse1 .cse2 (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4 .cse5))) [2022-11-25 17:19:28,004 INFO L902 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2022-11-25 17:19:28,004 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,004 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2022-11-25 17:19:28,004 INFO L895 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-11-25 17:19:28,005 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2022-11-25 17:19:28,005 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2022-11-25 17:19:28,006 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,006 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2022-11-25 17:19:28,006 INFO L899 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2022-11-25 17:19:28,006 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-11-25 17:19:28,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:19:28,007 INFO L895 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse2 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 ~p_dw_pc~0) .cse3 .cse4 .cse5) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-11-25 17:19:28,007 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-11-25 17:19:28,007 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,007 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2022-11-25 17:19:28,007 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-25 17:19:28,008 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-11-25 17:19:28,008 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-11-25 17:19:28,008 INFO L895 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,008 INFO L895 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 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~t1_pc~0 0) .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7))) [2022-11-25 17:19:28,008 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0))) (or (let ((.cse0 (<= ~m_pc~0 0))) (and (or (<= 1 ~t1_pc~0) (not .cse0)) .cse1 .cse2 .cse3 .cse4 .cse5 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse0))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse1 .cse2 .cse3 (<= 2 ~T1_E~0) (<= (+ ~local~0 1) ~token~0) .cse4 .cse5 (< ~token~0 (+ 2 ~local~0)) (not (= ~t1_st~0 0))))) [2022-11-25 17:19:28,009 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2022-11-25 17:19:28,009 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2022-11-25 17:19:28,009 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-11-25 17:19:28,009 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:19:28,009 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,010 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,010 INFO L895 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))) [2022-11-25 17:19:28,010 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2022-11-25 17:19:28,010 INFO L895 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 1 ~p_dw_pc~0)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 (<= ~c_dr_pc~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5))) [2022-11-25 17:19:28,011 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,011 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,011 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,011 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2022-11-25 17:19:28,012 INFO L895 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (and (= ~p_dw_pc~0 0) .cse0 .cse1 .cse9 .cse7 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse7 .cse3 (< 1 ~p_dw_pc~0) .cse5 .cse6))) [2022-11-25 17:19:28,012 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,012 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,013 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,013 INFO L895 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,013 INFO L895 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse2 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= ~c_dr_pc~0 1)) (.cse3 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= 1 ~c_dr_pc~0) .cse6 .cse3 (< 1 ~p_dw_pc~0) .cse4 .cse5))) [2022-11-25 17:19:28,013 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-11-25 17:19:28,013 INFO L895 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))) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 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 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse13) (and .cse2 .cse12 .cse4 .cse14 .cse7 .cse8))) [2022-11-25 17:19:28,014 INFO L895 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse11 (<= ~m_pc~0 0))) (let ((.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse12 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse11)) (.cse9 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 (<= (+ ~local~0 1) ~token~0) .cse7 .cse8 (< ~token~0 (+ 2 ~local~0)) .cse9) (and (or (<= 1 ~t1_pc~0) (not .cse11)) .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0))))) [2022-11-25 17:19:28,014 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2022-11-25 17:19:28,014 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,014 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,015 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-11-25 17:19:28,015 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:19:28,015 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2022-11-25 17:19:28,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-11-25 17:19:28,015 INFO L895 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))) [2022-11-25 17:19:28,015 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 2)) [2022-11-25 17:19:28,016 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2022-11-25 17:19:28,016 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2022-11-25 17:19:28,016 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2022-11-25 17:19:28,016 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2022-11-25 17:19:28,016 INFO L895 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse6 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (<= 1 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 1 ~p_dw_pc~0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 (not .cse4) .cse7) (or .cse0 .cse1 (<= ~p_dw_pc~0 1) .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse8))) [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-11-25 17:19:28,017 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-11-25 17:19:28,018 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2022-11-25 17:19:28,018 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2022-11-25 17:19:28,018 INFO L902 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2022-11-25 17:19:28,018 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2022-11-25 17:19:28,018 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2022-11-25 17:19:28,018 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2022-11-25 17:19:28,018 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-25 17:19:28,019 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 763 782) no Hoare annotation was computed. [2022-11-25 17:19:28,019 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2022-11-25 17:19:28,020 INFO L902 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: true [2022-11-25 17:19:28,020 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2022-11-25 17:19:28,020 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2022-11-25 17:19:28,020 INFO L899 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2022-11-25 17:19:28,020 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse4 (not (= ~p_dw_pc~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse9 (not (<= 1 ~p_dw_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse6 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6 .cse9))) [2022-11-25 17:19:28,020 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2022-11-25 17:19:28,021 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-11-25 17:19:28,021 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2022-11-25 17:19:28,021 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2022-11-25 17:19:28,021 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.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)))) (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 .cse0 .cse1 .cse14 .cse3 .cse6 .cse8 .cse10) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (or .cse1 .cse14 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11))) [2022-11-25 17:19:28,021 INFO L899 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2022-11-25 17:19:28,022 INFO L899 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2022-11-25 17:19:28,022 INFO L899 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2022-11-25 17:19:28,025 INFO L445 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] [2022-11-25 17:19:28,028 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:19:28,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:19:28 BoogieIcfgContainer [2022-11-25 17:19:28,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:19:28,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:19:28,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:19:28,117 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:19:28,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:17:48" (3/4) ... [2022-11-25 17:19:28,120 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:19:28,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-25 17:19:28,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-25 17:19:28,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-25 17:19:28,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-25 17:19:28,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-25 17:19:28,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-25 17:19:28,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-25 17:19:28,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-25 17:19:28,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-25 17:19:28,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-25 17:19:28,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-25 17:19:28,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-25 17:19:28,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-25 17:19:28,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-25 17:19:28,138 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-25 17:19:28,139 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 17:19:28,140 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:19:28,140 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:19:28,167 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)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(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)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) [2022-11-25 17:19:28,167 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)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(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)) || !(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)) [2022-11-25 17:19:28,169 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 <= \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)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(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_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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)) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(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 && E_M == M_E) && M_E == 2)) || !(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) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(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)) || !(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)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) [2022-11-25 17:19:28,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(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)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(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_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((!(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(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 && E_M == M_E) && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(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)) || !(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)) [2022-11-25 17:19:28,216 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:19:28,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:19:28,217 INFO L158 Benchmark]: Toolchain (without parser) took 101836.27ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 133.1MB in the beginning and 1.1GB in the end (delta: -920.5MB). Peak memory consumption was 645.0MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,217 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:19:28,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.02ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 115.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.07ms. Allocated memory is still 176.2MB. Free memory was 115.4MB in the beginning and 112.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,218 INFO L158 Benchmark]: Boogie Preprocessor took 67.24ms. Allocated memory is still 176.2MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,218 INFO L158 Benchmark]: RCFGBuilder took 939.59ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 128.1MB in the end (delta: -17.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,219 INFO L158 Benchmark]: TraceAbstraction took 100054.95ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 126.9MB in the beginning and 1.1GB in the end (delta: -937.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 17:19:28,219 INFO L158 Benchmark]: Witness Printer took 100.04ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:19:28,220 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.22ms. Allocated memory is still 125.8MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.02ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 115.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.07ms. Allocated memory is still 176.2MB. Free memory was 115.4MB in the beginning and 112.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.24ms. Allocated memory is still 176.2MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.59ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 128.1MB in the end (delta: -17.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 100054.95ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 126.9MB in the beginning and 1.1GB in the end (delta: -937.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 100.04ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 99.9s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 63.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10686 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10393 mSDsluCounter, 16680 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11923 mSDsCounter, 2225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13331 IncrementalHoareTripleChecker+Invalid, 15556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2225 mSolverCounterUnsat, 4757 mSDtfsCounter, 13331 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1486 SyntacticMatches, 3 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3534occurred in iteration=17, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 2679 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 7721 PreInvPairs, 10347 NumberOfFragments, 13128 HoareAnnotationTreeSize, 7721 FomulaSimplifications, 33622 FormulaSimplificationTreeSizeReduction, 28.7s HoareSimplificationTime, 89 FomulaSimplificationsInter, 509881 FormulaSimplificationTreeSizeReductionInter, 34.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 3234 NumberOfCodeBlocks, 3234 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3202 ConstructedInterpolants, 0 QuantifiedInterpolants, 5840 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: (((((((((((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))) || (((((((1 <= t1_pc || !(m_pc <= 0)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 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) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || c_dr_pc == p_dw_pc) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) || !(1 <= p_dw_pc)) || !(q_read_ev == 2)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || p_dw_pc <= 1) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(T1_E == M_E)) || !(q_read_ev == 2))) && ((((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(1 <= c_dr_pc)) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && m_pc == t1_pc) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && E_M == M_E) && 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)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc))) && ((((((((((!(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)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) - 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)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(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)) || !(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 && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && 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) && 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) && E_M == M_E) && token <= local) && local <= token) && M_E == 2) || (((((((((T1_E == M_E && m_pc == t1_pc) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && E_M == M_E) && 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && 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 <= \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)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(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_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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)) || !(token < 2 + local)) || (__retres1 <= 0 && 0 <= __retres1)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(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 && E_M == M_E) && M_E == 2)) || !(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) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(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)) || !(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)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((((((1 <= t1_pc || !(m_pc <= 0)) && q_write_ev == q_read_ev) && 2 <= m_st) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_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 && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) && c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && ((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2))) - 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)) || ((((((((((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)) || (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && q_write_ev == q_read_ev) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && 2 <= E_1) && m_pc == t1_pc) && 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) && E_M == M_E) && 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2)) || (((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_dr_pc == 0)) || !(E_M == M_E)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 <= p_dw_pc)) && (((((((!(m_pc == t1_pc) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(E_M == M_E)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(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)) || !(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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)) || !(token < 2 + local)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (T1_E == M_E && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && ((((((((((!(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_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_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) && \result <= 0) && 0 <= \result)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((!(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)) || !(2 <= E_1)) || (((((((\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) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0))) && (((((((((((((!(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 && E_M == M_E) && M_E == 2)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((!(p_dw_st == 0) || (!(m_pc <= 0) && m_pc <= 1)) || !(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)) || !(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)) - 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && c_dr_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && m_pc == t1_pc) && c_dr_pc <= 1) && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || (((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && 1 < p_dw_pc) && E_M == M_E) && 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 && 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))) || (((((((((((2 <= E_1 && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 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) && 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) && (!(m_pc <= 1) || m_pc <= 0)) && 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) && 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))) || (((((q_write_ev == q_read_ev && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_dr_pc == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) || (((((T1_E == M_E && m_pc == t1_pc) && 1 <= p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2)) || ((((((p_dw_pc == 0 && T1_E == M_E) && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && E_M == M_E) && M_E == 2) RESULT: Ultimate proved your program to be correct! [2022-11-25 17:19:28,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db5e725e-927e-4565-af8a-102698672fae/bin/uautomizer-ZsLfNo2U6R/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