./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg --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 e4250f34aeb1bbaa6a68e9df4c6caead053a128de9d45e1f0dae379c6394c54d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:54:42,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:54:42,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:54:42,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:54:42,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:54:42,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:54:42,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:54:42,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:54:42,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:54:42,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:54:42,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:54:42,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:54:42,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:54:42,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:54:42,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:54:42,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:54:42,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:54:42,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:54:42,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:54:42,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:54:42,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:54:42,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:54:42,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:54:42,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:54:42,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:54:42,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:54:42,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:54:42,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:54:42,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:54:42,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:54:42,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:54:42,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:54:42,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:54:42,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:54:42,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:54:42,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:54:42,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:54:42,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:54:42,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:54:42,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:54:42,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:54:42,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 08:54:42,232 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:54:42,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:54:42,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:54:42,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:54:42,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:54:42,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:54:42,235 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:54:42,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:54:42,236 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:54:42,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:54:42,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:54:42,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:54:42,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 08:54:42,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:54:42,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 08:54:42,238 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:54:42,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:54:42,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:54:42,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 08:54:42,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:54:42,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:54:42,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:54:42,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:54:42,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:54:42,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:54:42,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 08:54:42,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:54:42,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 08:54:42,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 08:54:42,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 08:54:42,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 08:54:42,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:54:42,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/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_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg 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 -> e4250f34aeb1bbaa6a68e9df4c6caead053a128de9d45e1f0dae379c6394c54d [2021-10-28 08:54:42,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:54:42,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:54:42,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:54:42,647 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:54:42,650 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:54:42,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-28 08:54:42,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/data/7664db7e9/3449ab830f414f7e81dfeeb0dead7ee4/FLAG79915fcae [2021-10-28 08:54:43,357 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:54:43,358 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-28 08:54:43,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/data/7664db7e9/3449ab830f414f7e81dfeeb0dead7ee4/FLAG79915fcae [2021-10-28 08:54:43,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/data/7664db7e9/3449ab830f414f7e81dfeeb0dead7ee4 [2021-10-28 08:54:43,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:54:43,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:54:43,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:54:43,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:54:43,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:54:43,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:54:43" (1/1) ... [2021-10-28 08:54:43,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f505f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:43, skipping insertion in model container [2021-10-28 08:54:43,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:54:43" (1/1) ... [2021-10-28 08:54:43,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:54:43,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:54:43,980 WARN L228 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_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-28 08:54:44,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:54:44,040 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:54:44,055 WARN L228 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_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-28 08:54:44,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:54:44,105 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:54:44,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44 WrapperNode [2021-10-28 08:54:44,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:54:44,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:54:44,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:54:44,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:54:44,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:54:44,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:54:44,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:54:44,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:54:44,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:54:44,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:54:44,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:54:44,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:54:44,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (1/1) ... [2021-10-28 08:54:44,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:54:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:54:44,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:54:44,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:54:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:54:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:54:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:54:44,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:54:44,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:54:44,856 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-10-28 08:54:44,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:44 BoogieIcfgContainer [2021-10-28 08:54:44,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:54:44,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:54:44,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:54:44,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:54:44,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:54:43" (1/3) ... [2021-10-28 08:54:44,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a39ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:54:44, skipping insertion in model container [2021-10-28 08:54:44,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:54:44" (2/3) ... [2021-10-28 08:54:44,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a39ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:54:44, skipping insertion in model container [2021-10-28 08:54:44,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:44" (3/3) ... [2021-10-28 08:54:44,885 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-10-28 08:54:44,892 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:54:44,898 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 08:54:44,980 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:54:44,989 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 08:54:44,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 08:54:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 08:54:45,020 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:45,021 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:45,022 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2021-10-28 08:54:45,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:45,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365960400] [2021-10-28 08:54:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:45,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:45,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:45,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365960400] [2021-10-28 08:54:45,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365960400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:45,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:45,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:45,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016652080] [2021-10-28 08:54:45,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:45,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:45,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,310 INFO L87 Difference]: Start difference. First operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 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) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:45,502 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2021-10-28 08:54:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 34 [2021-10-28 08:54:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:45,521 INFO L225 Difference]: With dead ends: 214 [2021-10-28 08:54:45,521 INFO L226 Difference]: Without dead ends: 135 [2021-10-28 08:54:45,524 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-28 08:54:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2021-10-28 08:54:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 113 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2021-10-28 08:54:45,576 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2021-10-28 08:54:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:45,577 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2021-10-28 08:54:45,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2021-10-28 08:54:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 08:54:45,580 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:45,580 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:45,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 08:54:45,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2021-10-28 08:54:45,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:45,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481785191] [2021-10-28 08:54:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:45,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:45,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:45,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481785191] [2021-10-28 08:54:45,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481785191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:45,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:45,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:45,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663670487] [2021-10-28 08:54:45,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:45,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,694 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:45,758 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2021-10-28 08:54:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2021-10-28 08:54:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:45,763 INFO L225 Difference]: With dead ends: 323 [2021-10-28 08:54:45,763 INFO L226 Difference]: Without dead ends: 215 [2021-10-28 08:54:45,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-10-28 08:54:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2021-10-28 08:54:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3971291866028708) internal successors, (292), 210 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2021-10-28 08:54:45,802 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2021-10-28 08:54:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:45,803 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2021-10-28 08:54:45,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2021-10-28 08:54:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 08:54:45,807 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:45,808 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:45,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 08:54:45,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2021-10-28 08:54:45,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:45,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745968139] [2021-10-28 08:54:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:45,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:45,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:45,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745968139] [2021-10-28 08:54:45,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745968139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:45,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:45,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:45,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545504939] [2021-10-28 08:54:45,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:45,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,925 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:45,988 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2021-10-28 08:54:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2021-10-28 08:54:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:45,994 INFO L225 Difference]: With dead ends: 526 [2021-10-28 08:54:45,994 INFO L226 Difference]: Without dead ends: 321 [2021-10-28 08:54:45,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-28 08:54:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2021-10-28 08:54:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 295 states have (on average 1.383050847457627) internal successors, (408), 296 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2021-10-28 08:54:46,072 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2021-10-28 08:54:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:46,072 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2021-10-28 08:54:46,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2021-10-28 08:54:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 08:54:46,077 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:46,078 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:46,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 08:54:46,078 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2021-10-28 08:54:46,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:46,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933520668] [2021-10-28 08:54:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:46,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:46,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:46,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933520668] [2021-10-28 08:54:46,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933520668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:46,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:46,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:46,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876266028] [2021-10-28 08:54:46,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:46,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:46,170 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:46,257 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2021-10-28 08:54:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) Word has length 48 [2021-10-28 08:54:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:46,275 INFO L225 Difference]: With dead ends: 740 [2021-10-28 08:54:46,276 INFO L226 Difference]: Without dead ends: 449 [2021-10-28 08:54:46,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-10-28 08:54:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-10-28 08:54:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 447 states have (on average 1.3243847874720358) internal successors, (592), 448 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2021-10-28 08:54:46,382 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2021-10-28 08:54:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:46,383 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2021-10-28 08:54:46,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2021-10-28 08:54:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 08:54:46,389 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:46,389 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:46,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 08:54:46,389 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2021-10-28 08:54:46,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:46,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290625243] [2021-10-28 08:54:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:46,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:46,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:46,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290625243] [2021-10-28 08:54:46,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290625243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:46,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:46,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:46,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650820229] [2021-10-28 08:54:46,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:46,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:46,514 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:46,588 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2021-10-28 08:54:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) Word has length 52 [2021-10-28 08:54:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:46,594 INFO L225 Difference]: With dead ends: 914 [2021-10-28 08:54:46,594 INFO L226 Difference]: Without dead ends: 555 [2021-10-28 08:54:46,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-28 08:54:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-10-28 08:54:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 1.298372513562387) internal successors, (718), 554 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2021-10-28 08:54:46,635 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2021-10-28 08:54:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:46,637 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2021-10-28 08:54:46,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2021-10-28 08:54:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 08:54:46,646 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:46,646 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:46,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 08:54:46,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2021-10-28 08:54:46,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:46,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113506757] [2021-10-28 08:54:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:46,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:46,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:46,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113506757] [2021-10-28 08:54:46,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113506757] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:46,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:46,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:54:46,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245962528] [2021-10-28 08:54:46,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 08:54:46,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:46,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:54:46,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:54:46,763 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:46,928 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2021-10-28 08:54:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 08:54:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) Word has length 53 [2021-10-28 08:54:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:46,946 INFO L225 Difference]: With dead ends: 1620 [2021-10-28 08:54:46,947 INFO L226 Difference]: Without dead ends: 1203 [2021-10-28 08:54:46,948 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:54:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-10-28 08:54:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2021-10-28 08:54:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 577 states have (on average 1.2790294627383016) internal successors, (738), 578 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2021-10-28 08:54:46,995 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2021-10-28 08:54:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:46,996 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2021-10-28 08:54:46,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2021-10-28 08:54:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 08:54:46,998 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:46,999 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:46,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 08:54:47,000 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1443121595, now seen corresponding path program 1 times [2021-10-28 08:54:47,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:47,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532667812] [2021-10-28 08:54:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:47,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:47,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:47,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532667812] [2021-10-28 08:54:47,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532667812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:47,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:47,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 08:54:47,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598268043] [2021-10-28 08:54:47,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 08:54:47,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:54:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:54:47,113 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:47,268 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2021-10-28 08:54:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 08:54:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) Word has length 53 [2021-10-28 08:54:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:47,276 INFO L225 Difference]: With dead ends: 1356 [2021-10-28 08:54:47,276 INFO L226 Difference]: Without dead ends: 866 [2021-10-28 08:54:47,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:54:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-10-28 08:54:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2021-10-28 08:54:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 478 states have (on average 1.2761506276150627) internal successors, (610), 479 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2021-10-28 08:54:47,335 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2021-10-28 08:54:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:47,335 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2021-10-28 08:54:47,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2021-10-28 08:54:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 08:54:47,337 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:47,338 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:47,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 08:54:47,338 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1577075519, now seen corresponding path program 1 times [2021-10-28 08:54:47,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:47,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501918737] [2021-10-28 08:54:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:47,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 08:54:47,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:47,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501918737] [2021-10-28 08:54:47,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501918737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:47,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:47,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:47,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39464504] [2021-10-28 08:54:47,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:47,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:47,442 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:47,506 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2021-10-28 08:54:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) Word has length 53 [2021-10-28 08:54:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:47,513 INFO L225 Difference]: With dead ends: 862 [2021-10-28 08:54:47,513 INFO L226 Difference]: Without dead ends: 478 [2021-10-28 08:54:47,514 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-10-28 08:54:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2021-10-28 08:54:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 1.2505747126436781) internal successors, (544), 436 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2021-10-28 08:54:47,552 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2021-10-28 08:54:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:47,553 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2021-10-28 08:54:47,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2021-10-28 08:54:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 08:54:47,555 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:47,556 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:47,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 08:54:47,556 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2021-10-28 08:54:47,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:47,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614932610] [2021-10-28 08:54:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:47,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:47,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:47,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614932610] [2021-10-28 08:54:47,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614932610] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:47,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:47,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:54:47,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465736426] [2021-10-28 08:54:47,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:54:47,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:54:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:54:47,679 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:47,747 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2021-10-28 08:54:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:54:47,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) Word has length 53 [2021-10-28 08:54:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:47,753 INFO L225 Difference]: With dead ends: 481 [2021-10-28 08:54:47,753 INFO L226 Difference]: Without dead ends: 479 [2021-10-28 08:54:47,754 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:54:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-28 08:54:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2021-10-28 08:54:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.2465437788018434) internal successors, (541), 434 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2021-10-28 08:54:47,802 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2021-10-28 08:54:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:47,803 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2021-10-28 08:54:47,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2021-10-28 08:54:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 08:54:47,805 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:47,806 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:47,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 08:54:47,806 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2021-10-28 08:54:47,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:47,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16744165] [2021-10-28 08:54:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:47,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:47,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:47,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16744165] [2021-10-28 08:54:47,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16744165] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:54:47,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266084603] [2021-10-28 08:54:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:47,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:54:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:54:47,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:54:48,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 08:54:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:48,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 08:54:48,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:54:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:48,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266084603] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:54:48,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:54:48,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-28 08:54:48,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056417163] [2021-10-28 08:54:48,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:54:48,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:54:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:54:48,886 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:49,062 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2021-10-28 08:54:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 08:54:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 54 [2021-10-28 08:54:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:49,070 INFO L225 Difference]: With dead ends: 781 [2021-10-28 08:54:49,070 INFO L226 Difference]: Without dead ends: 779 [2021-10-28 08:54:49,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:54:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-10-28 08:54:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2021-10-28 08:54:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.2563291139240507) internal successors, (794), 632 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2021-10-28 08:54:49,143 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2021-10-28 08:54:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:49,145 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2021-10-28 08:54:49,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2021-10-28 08:54:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-28 08:54:49,148 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:49,148 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:49,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 08:54:49,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-28 08:54:49,373 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2021-10-28 08:54:49,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:49,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673014793] [2021-10-28 08:54:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:49,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:54:49,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:49,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673014793] [2021-10-28 08:54:49,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673014793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:49,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:49,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:49,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617553134] [2021-10-28 08:54:49,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:49,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:49,445 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:49,527 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2021-10-28 08:54:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) Word has length 69 [2021-10-28 08:54:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:49,532 INFO L225 Difference]: With dead ends: 966 [2021-10-28 08:54:49,532 INFO L226 Difference]: Without dead ends: 629 [2021-10-28 08:54:49,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-28 08:54:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-10-28 08:54:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.241796200345423) internal successors, (719), 579 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2021-10-28 08:54:49,618 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2021-10-28 08:54:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:49,618 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2021-10-28 08:54:49,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2021-10-28 08:54:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-28 08:54:49,621 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:49,622 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-28 08:54:49,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 08:54:49,623 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -630281229, now seen corresponding path program 1 times [2021-10-28 08:54:49,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:49,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319573094] [2021-10-28 08:54:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:49,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 08:54:49,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:49,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319573094] [2021-10-28 08:54:49,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319573094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:49,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:49,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:49,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444151833] [2021-10-28 08:54:49,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:49,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:49,670 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:49,785 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2021-10-28 08:54:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:49,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) Word has length 80 [2021-10-28 08:54:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:49,791 INFO L225 Difference]: With dead ends: 1172 [2021-10-28 08:54:49,791 INFO L226 Difference]: Without dead ends: 598 [2021-10-28 08:54:49,793 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-10-28 08:54:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2021-10-28 08:54:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.2072538860103628) internal successors, (699), 579 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2021-10-28 08:54:49,869 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2021-10-28 08:54:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:49,870 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2021-10-28 08:54:49,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2021-10-28 08:54:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-28 08:54:49,872 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:49,873 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:49,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 08:54:49,873 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2021-10-28 08:54:49,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:49,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604918332] [2021-10-28 08:54:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:49,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 08:54:49,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:49,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604918332] [2021-10-28 08:54:49,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604918332] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:49,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:49,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:49,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829278962] [2021-10-28 08:54:49,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:49,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:49,922 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:50,008 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2021-10-28 08:54:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) Word has length 81 [2021-10-28 08:54:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:50,011 INFO L225 Difference]: With dead ends: 911 [2021-10-28 08:54:50,011 INFO L226 Difference]: Without dead ends: 284 [2021-10-28 08:54:50,012 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-28 08:54:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-10-28 08:54:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.1387900355871887) internal successors, (320), 281 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2021-10-28 08:54:50,044 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2021-10-28 08:54:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:50,045 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2021-10-28 08:54:50,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2021-10-28 08:54:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-28 08:54:50,047 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:50,047 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:50,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 08:54:50,048 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2021-10-28 08:54:50,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:50,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957031527] [2021-10-28 08:54:50,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:50,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 08:54:50,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:50,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957031527] [2021-10-28 08:54:50,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957031527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:50,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:50,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:50,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579108368] [2021-10-28 08:54:50,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:50,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:50,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:50,104 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:50,146 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2021-10-28 08:54:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) Word has length 101 [2021-10-28 08:54:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:50,149 INFO L225 Difference]: With dead ends: 401 [2021-10-28 08:54:50,149 INFO L226 Difference]: Without dead ends: 279 [2021-10-28 08:54:50,150 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-28 08:54:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-10-28 08:54:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.1330935251798562) internal successors, (315), 278 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2021-10-28 08:54:50,179 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2021-10-28 08:54:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:50,180 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2021-10-28 08:54:50,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2021-10-28 08:54:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-28 08:54:50,182 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:50,182 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:50,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 08:54:50,183 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2021-10-28 08:54:50,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:50,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122407146] [2021-10-28 08:54:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:50,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-28 08:54:50,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:50,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122407146] [2021-10-28 08:54:50,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122407146] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:50,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:50,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:54:50,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817715] [2021-10-28 08:54:50,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:54:50,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:54:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:54:50,242 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:50,298 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2021-10-28 08:54:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:54:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) Word has length 102 [2021-10-28 08:54:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:50,301 INFO L225 Difference]: With dead ends: 395 [2021-10-28 08:54:50,301 INFO L226 Difference]: Without dead ends: 270 [2021-10-28 08:54:50,302 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:54:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-28 08:54:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-28 08:54:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.1152416356877324) internal successors, (300), 269 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2021-10-28 08:54:50,331 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2021-10-28 08:54:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:50,331 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2021-10-28 08:54:50,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2021-10-28 08:54:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-28 08:54:50,333 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:50,334 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:50,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 08:54:50,334 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2021-10-28 08:54:50,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:50,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777205827] [2021-10-28 08:54:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:50,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 08:54:50,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:50,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777205827] [2021-10-28 08:54:50,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777205827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:50,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:50,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:54:50,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423464192] [2021-10-28 08:54:50,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:54:50,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:54:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:50,402 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:50,463 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2021-10-28 08:54:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:54:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) Word has length 102 [2021-10-28 08:54:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:50,467 INFO L225 Difference]: With dead ends: 400 [2021-10-28 08:54:50,467 INFO L226 Difference]: Without dead ends: 259 [2021-10-28 08:54:50,468 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:54:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-28 08:54:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2021-10-28 08:54:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.0883534136546185) internal successors, (271), 249 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2021-10-28 08:54:50,497 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2021-10-28 08:54:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:50,498 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2021-10-28 08:54:50,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2021-10-28 08:54:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-28 08:54:50,500 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:54:50,500 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:54:50,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 08:54:50,501 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:54:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:54:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2021-10-28 08:54:50,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:54:50,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711411653] [2021-10-28 08:54:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:54:50,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:54:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:54:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 08:54:50,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:54:50,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711411653] [2021-10-28 08:54:50,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711411653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:54:50,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:54:50,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:54:50,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903269213] [2021-10-28 08:54:50,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 08:54:50,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:54:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:54:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:54:50,601 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:54:50,643 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2021-10-28 08:54:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:54:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) Word has length 103 [2021-10-28 08:54:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:54:50,645 INFO L225 Difference]: With dead ends: 250 [2021-10-28 08:54:50,645 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 08:54:50,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:54:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 08:54:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 08:54:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 08:54:50,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2021-10-28 08:54:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:54:50,647 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 08:54:50,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:54:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 08:54:50,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 08:54:50,651 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:54:50,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:54:50,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 08:54:50,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 08:54:50,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:50,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:50,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:50,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:50,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:50,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:51,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:52,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:52,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:52,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:54:52,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:55:00,721 INFO L857 garLoopResultBuilder]: For program point L316(line 316) no Hoare annotation was computed. [2021-10-28 08:55:00,721 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-28 08:55:00,722 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 08:55:00,722 INFO L857 garLoopResultBuilder]: For program point L53(lines 53 62) no Hoare annotation was computed. [2021-10-28 08:55:00,722 INFO L857 garLoopResultBuilder]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2021-10-28 08:55:00,722 INFO L857 garLoopResultBuilder]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2021-10-28 08:55:00,722 INFO L857 garLoopResultBuilder]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2021-10-28 08:55:00,723 INFO L853 garLoopResultBuilder]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,723 INFO L857 garLoopResultBuilder]: For program point L268(lines 268 275) no Hoare annotation was computed. [2021-10-28 08:55:00,723 INFO L857 garLoopResultBuilder]: For program point L153(lines 152 187) no Hoare annotation was computed. [2021-10-28 08:55:00,723 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 59) no Hoare annotation was computed. [2021-10-28 08:55:00,723 INFO L857 garLoopResultBuilder]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L853 garLoopResultBuilder]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 260) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 225) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 08:55:00,724 INFO L857 garLoopResultBuilder]: For program point L240(line 240) no Hoare annotation was computed. [2021-10-28 08:55:00,725 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 186) no Hoare annotation was computed. [2021-10-28 08:55:00,725 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2021-10-28 08:55:00,725 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 181) no Hoare annotation was computed. [2021-10-28 08:55:00,725 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 80) no Hoare annotation was computed. [2021-10-28 08:55:00,725 INFO L853 garLoopResultBuilder]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse5 (<= ~p_num_write~0 1)) (.cse9 (<= 1 ~p_num_write~0)) (.cse8 (<= .cse22 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse22)) (.cse3 (= ~q_free~0 0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_dr_pc~0 1)) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 1)) (.cse14 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse15 .cse2 .cse3 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse10) (and .cse15 .cse2 .cse3 .cse12 .cse16) (and .cse0 .cse17 .cse15 .cse2 .cse18 .cse19 .cse20 .cse4 .cse6 .cse21 .cse7) (and .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse17 .cse2 .cse18 .cse19 .cse20 .cse6 .cse14 .cse21 .cse7) (and .cse0 .cse15 .cse19 .cse14)))) [2021-10-28 08:55:00,725 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L110(lines 109 129) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 08:55:00,726 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-10-28 08:55:00,727 INFO L853 garLoopResultBuilder]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 0)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse5 (= ~q_read_ev~0 2)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (= ~c_dr_st~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse8 .cse2 .cse4 .cse9 (= ~p_dw_pc~0 1) .cse5 .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse8 .cse6))) [2021-10-28 08:55:00,727 INFO L853 garLoopResultBuilder]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse12 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~c_dr_st~0 2)) (.cse4 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 0)) (.cse10 (<= ~p_num_write~0 1)) (.cse5 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse6 (<= .cse12 ~p_num_write~0)) (.cse11 (<= 1 ~p_num_write~0)) (.cse7 (<= ~p_num_write~0 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_pc~0 1) .cse5 .cse6 .cse7) (and .cse0 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse8) (and .cse9 .cse0 .cse2 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse7) (and .cse9 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse10 .cse5 .cse8 .cse6 .cse11 .cse7)))) [2021-10-28 08:55:00,727 INFO L853 garLoopResultBuilder]: At program point L45-1(lines 33 47) the Hoare annotation is: (let ((.cse5 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse6 (= ~c_num_read~0 1)) (.cse7 (<= ~p_num_write~0 1)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= 2 ~p_dw_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse7 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse8) (and .cse0 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8))) [2021-10-28 08:55:00,727 INFO L853 garLoopResultBuilder]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse1 (= ~p_dw_pc~0 1)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= 2 ~p_dw_st~0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 1)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse2 (= ~q_read_ev~0 2)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (not (= ~q_write_ev~0 1)))) (or (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse0 (= ~q_free~0 0) (<= ~p_num_write~0 1) .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (<= .cse5 ~p_num_write~0) (<= 1 ~p_num_write~0) (<= ~p_num_write~0 .cse5))) (and .cse0 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse4 .cse10) (and .cse0 .cse6 .cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse1 .cse3 .cse9 .cse10) (and .cse11 (= ~p_num_write~0 0) .cse12 .cse0 .cse6 .cse3 .cse9) (and .cse11 .cse12 .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse2 .cse9 .cse4))) [2021-10-28 08:55:00,727 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2021-10-28 08:55:00,728 INFO L857 garLoopResultBuilder]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2021-10-28 08:55:00,728 INFO L853 garLoopResultBuilder]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 1) (= ~p_dw_pc~0 1) (= ~q_read_ev~0 2) (= 2 ~p_dw_st~0) (not (= ~q_write_ev~0 1)) (<= .cse0 ~p_num_write~0) (<= ~p_num_write~0 .cse0))) [2021-10-28 08:55:00,728 INFO L853 garLoopResultBuilder]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse3 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (<= ~p_num_write~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (<= .cse13 ~p_num_write~0)) (.cse12 (<= 1 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse2 .cse6 .cse7 .cse3 (= ~p_dw_pc~0 1) .cse8 .cse9 .cse10) (and .cse0 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse3 .cse11 .cse8 .cse4 .cse9 .cse12 .cse10) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse6 .cse7 .cse3 .cse11 .cse8 .cse9 .cse12 .cse10)))) [2021-10-28 08:55:00,728 INFO L853 garLoopResultBuilder]: At program point L46-1(lines 30 48) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse6 (= ~c_num_read~0 1)) (.cse7 (<= ~p_num_write~0 1)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= 2 ~p_dw_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= ~q_write_ev~0 1))) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse6 .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse6 .cse7 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse8))) [2021-10-28 08:55:00,732 INFO L860 garLoopResultBuilder]: At program point L360(lines 351 362) the Hoare annotation is: true [2021-10-28 08:55:00,732 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 299) no Hoare annotation was computed. [2021-10-28 08:55:00,733 INFO L853 garLoopResultBuilder]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,733 INFO L853 garLoopResultBuilder]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,733 INFO L860 garLoopResultBuilder]: At program point L328(lines 305 333) the Hoare annotation is: true [2021-10-28 08:55:00,734 INFO L853 garLoopResultBuilder]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,734 INFO L853 garLoopResultBuilder]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,735 INFO L853 garLoopResultBuilder]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~c_dr_pc~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (<= ~p_num_write~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse10 (<= .cse16 ~p_num_write~0)) (.cse11 (<= 1 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse16))) (or (and .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse3 .cse9) (and .cse13 .cse1 .cse4 .cse14 .cse15 .cse8 .cse10 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse13 .cse1 .cse3 .cse4 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2021-10-28 08:55:00,735 INFO L853 garLoopResultBuilder]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse5 (<= ~p_num_write~0 1)) (.cse6 (= ~p_dw_pc~0 1)) (.cse13 (= 2 ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse3 .cse12 (= ~c_num_read~0 1) .cse5 .cse6 .cse13 .cse8 .cse10))) [2021-10-28 08:55:00,735 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 106) no Hoare annotation was computed. [2021-10-28 08:55:00,736 INFO L853 garLoopResultBuilder]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse4 (= ~p_dw_pc~0 1)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 0)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (<= ~p_num_write~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (<= .cse17 ~p_num_write~0)) (.cse16 (<= 1 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse14 .cse5) (and .cse11 (= ~c_dr_st~0 0) .cse1 .cse12 .cse2 .cse3 .cse13 .cse14 .cse15 .cse5 .cse7 .cse10 .cse8 .cse16 .cse9) (and .cse11 .cse0 .cse1 .cse12 .cse3 .cse13 .cse6 .cse14 .cse15 .cse7 .cse8 .cse16 .cse9)))) [2021-10-28 08:55:00,736 INFO L853 garLoopResultBuilder]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= ~c_dr_pc~0 1)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse3 (= ~c_num_read~0 1)) (.cse4 (<= ~p_num_write~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse15 (= 2 ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse14 .cse13 .cse5 .cse6 .cse15 .cse8 .cse9) (and .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse15 .cse8 .cse10))) [2021-10-28 08:55:00,737 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 08:55:00,737 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-28 08:55:00,737 INFO L853 garLoopResultBuilder]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,738 INFO L853 garLoopResultBuilder]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,741 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 202) no Hoare annotation was computed. [2021-10-28 08:55:00,741 INFO L857 garLoopResultBuilder]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2021-10-28 08:55:00,742 INFO L857 garLoopResultBuilder]: For program point L34(lines 34 43) no Hoare annotation was computed. [2021-10-28 08:55:00,742 INFO L857 garLoopResultBuilder]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2021-10-28 08:55:00,742 INFO L857 garLoopResultBuilder]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2021-10-28 08:55:00,744 INFO L857 garLoopResultBuilder]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2021-10-28 08:55:00,745 INFO L853 garLoopResultBuilder]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= ~c_num_read~0 ~p_num_write~0) (= ~q_free~0 1) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1))) [2021-10-28 08:55:00,745 INFO L853 garLoopResultBuilder]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,746 INFO L853 garLoopResultBuilder]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-10-28 08:55:00,746 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 226) no Hoare annotation was computed. [2021-10-28 08:55:00,746 INFO L857 garLoopResultBuilder]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2021-10-28 08:55:00,746 INFO L857 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2021-10-28 08:55:00,746 INFO L853 garLoopResultBuilder]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (= ~c_dr_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (<= ~p_num_write~0 1)) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (<= .cse19 ~p_num_write~0)) (.cse18 (<= 1 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse11 .cse17 .cse12 .cse18 .cse13) (and .cse1 .cse14 .cse6 .cse16 .cse17) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11 .cse12 .cse18 .cse13)))) [2021-10-28 08:55:00,747 INFO L857 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2021-10-28 08:55:00,747 INFO L853 garLoopResultBuilder]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse11 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse2 (= ~c_num_read~0 1)) (.cse3 (<= ~p_num_write~0 1)) (.cse4 (= ~p_dw_pc~0 1)) (.cse13 (= 2 ~p_dw_st~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse13 .cse6 .cse8))) [2021-10-28 08:55:00,747 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-10-28 08:55:00,747 INFO L857 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2021-10-28 08:55:00,748 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2021-10-28 08:55:00,755 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:55:00,757 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:55:00,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:55:00 BoogieIcfgContainer [2021-10-28 08:55:00,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:55:00,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:55:00,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:55:00,857 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:55:00,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:54:44" (3/4) ... [2021-10-28 08:55:00,862 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 08:55:00,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 08:55:00,881 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 08:55:00,882 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 08:55:00,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 08:55:00,914 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,915 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,915 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,917 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,917 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0)) || ((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || ((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0) [2021-10-28 08:55:00,919 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) [2021-10-28 08:55:00,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) || (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && 0 == \result) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) [2021-10-28 08:55:00,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1) && \result == 0) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) [2021-10-28 08:55:00,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) || (((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || (((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 08:55:00,963 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 08:55:00,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:55:00,965 INFO L168 Benchmark]: Toolchain (without parser) took 17235.31 ms. Allocated memory was 88.1 MB in the beginning and 169.9 MB in the end (delta: 81.8 MB). Free memory was 51.6 MB in the beginning and 119.6 MB in the end (delta: -68.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,966 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory is still 68.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:55:00,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.32 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 51.3 MB in the beginning and 81.4 MB in the end (delta: -30.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.03 ms. Allocated memory is still 107.0 MB. Free memory was 81.4 MB in the beginning and 79.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,967 INFO L168 Benchmark]: Boogie Preprocessor took 42.92 ms. Allocated memory is still 107.0 MB. Free memory was 79.3 MB in the beginning and 78.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,968 INFO L168 Benchmark]: RCFGBuilder took 651.30 ms. Allocated memory is still 107.0 MB. Free memory was 78.0 MB in the beginning and 63.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,968 INFO L168 Benchmark]: TraceAbstraction took 15995.05 ms. Allocated memory was 107.0 MB in the beginning and 169.9 MB in the end (delta: 62.9 MB). Free memory was 62.5 MB in the beginning and 126.9 MB in the end (delta: -64.4 MB). Peak memory consumption was 83.8 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,969 INFO L168 Benchmark]: Witness Printer took 106.53 ms. Allocated memory is still 169.9 MB. Free memory was 126.9 MB in the beginning and 119.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:55:00,972 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.33 ms. Allocated memory is still 88.1 MB. Free memory is still 68.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 376.32 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 51.3 MB in the beginning and 81.4 MB in the end (delta: -30.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.03 ms. Allocated memory is still 107.0 MB. Free memory was 81.4 MB in the beginning and 79.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.92 ms. Allocated memory is still 107.0 MB. Free memory was 79.3 MB in the beginning and 78.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 651.30 ms. Allocated memory is still 107.0 MB. Free memory was 78.0 MB in the beginning and 63.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15995.05 ms. Allocated memory was 107.0 MB in the beginning and 169.9 MB in the end (delta: 62.9 MB). Free memory was 62.5 MB in the beginning and 126.9 MB in the end (delta: -64.4 MB). Peak memory consumption was 83.8 MB. Max. memory is 16.1 GB. * Witness Printer took 106.53 ms. Allocated memory is still 169.9 MB. Free memory was 126.9 MB in the beginning and 119.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * 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: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: 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 1 procedures, 76 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1685 SDslu, 2247 SDs, 0 SdLazy, 211 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5192 HoareAnnotationTreeSize, 27 FomulaSimplifications, 66262 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 27 FomulaSimplificationsInter, 14930 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 2840 SizeOfPredicates, 2 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 280/284 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: 140]: Loop Invariant Derived loop invariant: (((((((((((((p_last_write == q_buf_0 && q_free == 0) && p_num_write <= 1) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((p_last_write == q_buf_0 && q_free == 1) && p_num_write <= c_num_read) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || (((((((p_last_write == q_buf_0 && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || (((((((((p_dw_pc == 0 && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1)) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) || (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write)) || ((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0)) || ((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || ((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && 0 == \result) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && p_num_write <= 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) || (((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || (((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1) && \result == 0) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) RESULT: Ultimate proved your program to be correct! [2021-10-28 08:55:01,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05fdc02c-aae7-4b41-9f4e-a9a0e8ff41a9/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...