/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:06:17,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:06:17,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:06:17,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:06:17,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:06:17,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:06:17,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:06:17,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:06:17,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:06:17,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:06:17,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:06:17,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:06:17,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:06:17,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:06:17,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:06:17,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:06:17,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:06:17,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:06:17,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:06:17,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:06:17,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:06:17,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:06:17,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:06:17,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:06:17,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:06:17,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:06:17,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:06:17,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:06:17,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:06:17,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:06:17,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:06:17,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:06:17,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:06:17,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:06:17,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:06:17,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:06:17,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:06:17,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:06:17,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:06:17,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:06:17,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:06:17,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:06:17,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:06:17,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:06:17,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:06:17,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:06:17,365 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:06:17,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:06:17,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:06:17,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:06:17,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:06:17,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:06:17,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:17,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:06:17,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:06:17,368 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2022-12-05 23:06:17,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:06:17,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:06:17,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:06:17,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:06:17,633 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:06:17,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:06:18,679 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:06:18,855 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:06:18,855 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:06:18,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571f4d81c/c0f34c84e1ff4ad099c05e19eb179ffd/FLAGf264818a1 [2022-12-05 23:06:18,874 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571f4d81c/c0f34c84e1ff4ad099c05e19eb179ffd [2022-12-05 23:06:18,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:06:18,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:06:18,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:18,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:06:18,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:06:18,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:18" (1/1) ... [2022-12-05 23:06:18,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198f9792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:18, skipping insertion in model container [2022-12-05 23:06:18,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:18" (1/1) ... [2022-12-05 23:06:18,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:06:18,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:06:18,999 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-05 23:06:19,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:19,120 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:06:19,128 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-05 23:06:19,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:19,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:19,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:19,179 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:06:19,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19 WrapperNode [2022-12-05 23:06:19,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:19,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:19,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:06:19,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:06:19,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,225 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-05 23:06:19,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:19,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:06:19,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:06:19,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:06:19,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,256 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:06:19,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:06:19,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:06:19,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:06:19,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (1/1) ... [2022-12-05 23:06:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:06:19,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:06:19,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:06:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:06:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:06:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:06:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:06:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:06:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:06:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:06:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:06:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:06:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:06:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:06:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:06:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:06:19,326 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:06:19,441 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:06:19,442 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:06:19,742 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:06:19,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:06:19,881 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:06:19,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:19 BoogieIcfgContainer [2022-12-05 23:06:19,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:06:19,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:06:19,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:06:19,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:06:19,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:06:18" (1/3) ... [2022-12-05 23:06:19,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1369cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:19, skipping insertion in model container [2022-12-05 23:06:19,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:19" (2/3) ... [2022-12-05 23:06:19,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1369cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:19, skipping insertion in model container [2022-12-05 23:06:19,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:19" (3/3) ... [2022-12-05 23:06:19,892 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 23:06:19,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:06:19,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:06:19,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:06:19,946 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:06:19,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-05 23:06:20,029 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-05 23:06:20,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:20,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:06:20,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-05 23:06:20,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-05 23:06:20,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:20,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-05 23:06:20,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-05 23:06:20,097 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-05 23:06:20,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:20,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 23:06:20,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-05 23:06:20,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-05 23:06:23,353 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-05 23:06:23,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:06:23,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2254d294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:06:23,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:06:23,380 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:06:23,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:23,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:23,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:06:23,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash 374744491, now seen corresponding path program 1 times [2022-12-05 23:06:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:23,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32699411] [2022-12-05 23:06:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:23,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32699411] [2022-12-05 23:06:23,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32699411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:23,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:23,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:06:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389211137] [2022-12-05 23:06:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:23,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:23,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:23,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:06:23,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:23,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:23,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:06:23,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:23,810 INFO L130 PetriNetUnfolder]: 159/309 cut-off events. [2022-12-05 23:06:23,810 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:06:23,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1365 event pairs, 24 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 593. Up to 220 conditions per place. [2022-12-05 23:06:23,813 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-05 23:06:23,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 110 flow [2022-12-05 23:06:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:06:23,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:06:23,822 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:06:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 110 flow [2022-12-05 23:06:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:23,825 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-05 23:06:23,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-05 23:06:23,829 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:06:23,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:23,829 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-05 23:06:23,831 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:23,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:23,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-05 23:06:23,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-05 23:06:23,836 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 23:06:23,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:23,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:06:23,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-05 23:06:23,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-05 23:06:24,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:06:24,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-05 23:06:24,098 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 23:06:24,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:24,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:24,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:24,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:06:24,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -647741992, now seen corresponding path program 1 times [2022-12-05 23:06:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834846607] [2022-12-05 23:06:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834846607] [2022-12-05 23:06:24,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834846607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:24,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:24,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535849397] [2022-12-05 23:06:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:24,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:24,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-05 23:06:24,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:24,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:24,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-05 23:06:24,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:24,712 INFO L130 PetriNetUnfolder]: 105/209 cut-off events. [2022-12-05 23:06:24,712 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:06:24,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 209 events. 105/209 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 751 event pairs, 22 based on Foata normal form. 10/219 useless extension candidates. Maximal degree in co-relation 424. Up to 119 conditions per place. [2022-12-05 23:06:24,713 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 23 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2022-12-05 23:06:24,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 118 flow [2022-12-05 23:06:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:06:24,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:06:24,719 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:06:24,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 118 flow [2022-12-05 23:06:24,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:24,722 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 23:06:24,723 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:06:24,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:24,723 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,724 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:24,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:24,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,729 INFO L130 PetriNetUnfolder]: 4/27 cut-off events. [2022-12-05 23:06:24,729 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-05 23:06:24,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 27 events. 4/27 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 48. Up to 12 conditions per place. [2022-12-05 23:06:24,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 23:06:24,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:24,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:06:24,737 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 59 flow [2022-12-05 23:06:24,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:24,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:24,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:24,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:06:24,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 404930513, now seen corresponding path program 1 times [2022-12-05 23:06:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:24,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429082316] [2022-12-05 23:06:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:24,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429082316] [2022-12-05 23:06:24,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429082316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:24,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:24,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880717027] [2022-12-05 23:06:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:24,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:24,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:24,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 23:06:24,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:24,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:24,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 23:06:24,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:24,977 INFO L130 PetriNetUnfolder]: 54/125 cut-off events. [2022-12-05 23:06:24,977 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-05 23:06:24,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 125 events. 54/125 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 425 event pairs, 10 based on Foata normal form. 18/142 useless extension candidates. Maximal degree in co-relation 324. Up to 60 conditions per place. [2022-12-05 23:06:24,978 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 21 selfloop transitions, 3 changer transitions 16/42 dead transitions. [2022-12-05 23:06:24,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 227 flow [2022-12-05 23:06:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:06:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:06:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-05 23:06:24,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-05 23:06:24,979 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 59 flow. Second operand 5 states and 46 transitions. [2022-12-05 23:06:24,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 227 flow [2022-12-05 23:06:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:24,980 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 81 flow [2022-12-05 23:06:24,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-05 23:06:24,981 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-05 23:06:24,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:24,989 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 81 flow [2022-12-05 23:06:24,989 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:24,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:24,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 81 flow [2022-12-05 23:06:24,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 81 flow [2022-12-05 23:06:24,995 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-05 23:06:24,995 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-12-05 23:06:24,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 43 events. 9/43 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 115 event pairs, 4 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 100. Up to 16 conditions per place. [2022-12-05 23:06:24,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 81 flow [2022-12-05 23:06:24,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-05 23:06:24,997 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:24,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 23:06:24,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 81 flow [2022-12-05 23:06:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:24,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:24,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:06:24,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1111999474, now seen corresponding path program 1 times [2022-12-05 23:06:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:24,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882072286] [2022-12-05 23:06:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:25,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:25,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882072286] [2022-12-05 23:06:25,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882072286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:25,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:25,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:06:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632326832] [2022-12-05 23:06:25,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:25,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:06:25,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:06:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:06:25,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 23:06:25,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:25,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:25,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 23:06:25,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:25,177 INFO L130 PetriNetUnfolder]: 22/64 cut-off events. [2022-12-05 23:06:25,177 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-05 23:06:25,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 64 events. 22/64 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 171 event pairs, 7 based on Foata normal form. 8/71 useless extension candidates. Maximal degree in co-relation 191. Up to 25 conditions per place. [2022-12-05 23:06:25,179 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 19 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2022-12-05 23:06:25,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2022-12-05 23:06:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:06:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:06:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-05 23:06:25,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:06:25,182 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 81 flow. Second operand 6 states and 42 transitions. [2022-12-05 23:06:25,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2022-12-05 23:06:25,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 184 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:06:25,184 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 86 flow [2022-12-05 23:06:25,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-05 23:06:25,185 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-05 23:06:25,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:25,185 INFO L89 Accepts]: Start accepts. Operand has 33 places, 19 transitions, 86 flow [2022-12-05 23:06:25,187 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:25,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:25,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 86 flow [2022-12-05 23:06:25,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 86 flow [2022-12-05 23:06:25,190 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-05 23:06:25,191 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:06:25,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 25 events. 3/25 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 53. Up to 8 conditions per place. [2022-12-05 23:06:25,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 86 flow [2022-12-05 23:06:25,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-05 23:06:26,026 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:26,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 842 [2022-12-05 23:06:26,027 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 82 flow [2022-12-05 23:06:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:26,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:26,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:26,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:06:26,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1478818230, now seen corresponding path program 1 times [2022-12-05 23:06:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:26,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014294672] [2022-12-05 23:06:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014294672] [2022-12-05 23:06:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014294672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:26,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:26,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951626631] [2022-12-05 23:06:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:26,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:26,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-05 23:06:26,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:26,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:26,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-05 23:06:26,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:26,219 INFO L130 PetriNetUnfolder]: 23/73 cut-off events. [2022-12-05 23:06:26,219 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-05 23:06:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 73 events. 23/73 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 235 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 214. Up to 38 conditions per place. [2022-12-05 23:06:26,220 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 17 selfloop transitions, 1 changer transitions 12/31 dead transitions. [2022-12-05 23:06:26,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 209 flow [2022-12-05 23:06:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-05 23:06:26,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-05 23:06:26,221 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 82 flow. Second operand 4 states and 27 transitions. [2022-12-05 23:06:26,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 209 flow [2022-12-05 23:06:26,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 184 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 23:06:26,223 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 73 flow [2022-12-05 23:06:26,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-12-05 23:06:26,223 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-05 23:06:26,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:26,224 INFO L89 Accepts]: Start accepts. Operand has 29 places, 17 transitions, 73 flow [2022-12-05 23:06:26,224 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:26,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:26,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 17 transitions, 73 flow [2022-12-05 23:06:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 17 transitions, 73 flow [2022-12-05 23:06:26,228 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-05 23:06:26,228 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:06:26,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 25 events. 2/25 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 52. Up to 7 conditions per place. [2022-12-05 23:06:26,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 17 transitions, 73 flow [2022-12-05 23:06:26,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-05 23:06:26,334 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:26,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-05 23:06:26,335 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 69 flow [2022-12-05 23:06:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:26,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:26,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:26,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:06:26,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -477134852, now seen corresponding path program 1 times [2022-12-05 23:06:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646687221] [2022-12-05 23:06:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646687221] [2022-12-05 23:06:26,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646687221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:26,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:26,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:06:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430421900] [2022-12-05 23:06:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:26,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:06:26,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:06:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:06:26,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-05 23:06:26,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 69 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:26,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:26,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-05 23:06:26,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:27,026 INFO L130 PetriNetUnfolder]: 13/45 cut-off events. [2022-12-05 23:06:27,027 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-05 23:06:27,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 45 events. 13/45 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 1 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 145. Up to 24 conditions per place. [2022-12-05 23:06:27,027 INFO L137 encePairwiseOnDemand]: 6/11 looper letters, 12 selfloop transitions, 4 changer transitions 8/24 dead transitions. [2022-12-05 23:06:27,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 158 flow [2022-12-05 23:06:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:06:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:06:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-12-05 23:06:27,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-05 23:06:27,028 INFO L175 Difference]: Start difference. First operand has 26 places, 15 transitions, 69 flow. Second operand 5 states and 20 transitions. [2022-12-05 23:06:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 158 flow [2022-12-05 23:06:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 154 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:27,029 INFO L231 Difference]: Finished difference. Result has 30 places, 15 transitions, 82 flow [2022-12-05 23:06:27,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=15} [2022-12-05 23:06:27,030 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-05 23:06:27,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:27,030 INFO L89 Accepts]: Start accepts. Operand has 30 places, 15 transitions, 82 flow [2022-12-05 23:06:27,030 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:27,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:27,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 15 transitions, 82 flow [2022-12-05 23:06:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 15 transitions, 82 flow [2022-12-05 23:06:27,034 INFO L130 PetriNetUnfolder]: 2/18 cut-off events. [2022-12-05 23:06:27,034 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:06:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 18 events. 2/18 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 47. Up to 6 conditions per place. [2022-12-05 23:06:27,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 15 transitions, 82 flow [2022-12-05 23:06:27,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:06:27,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [284] L768-->L775: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$w_buff0_used~0_101 (ite .cse0 0 v_~x$w_buff0_used~0_102)) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x$w_buff1_used~0_90 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_91)) (= v_~x~0_69 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse4 v_~x$w_buff1~0_43 v_~x~0_70)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [371] $Ultimate##0-->L768: Formula: (and (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_421 256) 0)) (not (= (mod v_~x$w_buff1_used~0_379 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_36 v_~__unbuffered_p1_EAX~0_87) (= v_~x$w_buff0~0_278 v_~x$w_buff1~0_245) (= v_~x$w_buff0_used~0_422 v_~x$w_buff1_used~0_379) (= v_~x$r_buff0_thd0~0_254 v_~x$r_buff1_thd0~0_259) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_117) (= v_~x$r_buff0_thd2~0_144 1) (= v_~x$r_buff1_thd1~0_103 v_~x$r_buff0_thd1~0_94) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (= 2 v_~x$w_buff0~0_277) (= v_~x$w_buff0_used~0_421 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_278, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_254, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_94, ~y~0=v_~y~0_36, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_422} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_277, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_254, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_94, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_379, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_103, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_259, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_421, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y~0=v_~y~0_36} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] [2022-12-05 23:06:27,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [284] L768-->L775: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$w_buff0_used~0_101 (ite .cse0 0 v_~x$w_buff0_used~0_102)) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x$w_buff1_used~0_90 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_91)) (= v_~x~0_69 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse4 v_~x$w_buff1~0_43 v_~x~0_70)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [371] $Ultimate##0-->L768: Formula: (and (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_421 256) 0)) (not (= (mod v_~x$w_buff1_used~0_379 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_36 v_~__unbuffered_p1_EAX~0_87) (= v_~x$w_buff0~0_278 v_~x$w_buff1~0_245) (= v_~x$w_buff0_used~0_422 v_~x$w_buff1_used~0_379) (= v_~x$r_buff0_thd0~0_254 v_~x$r_buff1_thd0~0_259) (= v_~x$r_buff0_thd2~0_145 v_~x$r_buff1_thd2~0_117) (= v_~x$r_buff0_thd2~0_144 1) (= v_~x$r_buff1_thd1~0_103 v_~x$r_buff0_thd1~0_94) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (= 2 v_~x$w_buff0~0_277) (= v_~x$w_buff0_used~0_421 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_278, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_254, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_94, ~y~0=v_~y~0_36, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_422} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_277, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_254, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_94, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_379, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_103, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_259, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_421, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y~0=v_~y~0_36} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] [2022-12-05 23:06:27,411 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:27,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-05 23:06:27,412 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 103 flow [2022-12-05 23:06:27,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:27,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:27,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:27,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:06:27,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:06:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1963067968, now seen corresponding path program 2 times [2022-12-05 23:06:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:27,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803481636] [2022-12-05 23:06:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:27,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:06:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:27,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:06:27,469 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:06:27,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:06:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:06:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:06:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:06:27,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:06:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:06:27,472 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-05 23:06:27,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:06:27,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:06:27,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:06:27 BasicIcfg [2022-12-05 23:06:27,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:06:27,503 INFO L158 Benchmark]: Toolchain (without parser) took 8626.37ms. Allocated memory was 195.0MB in the beginning and 413.1MB in the end (delta: 218.1MB). Free memory was 170.4MB in the beginning and 222.8MB in the end (delta: -52.4MB). Peak memory consumption was 166.2MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,503 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:06:27,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.72ms. Allocated memory is still 195.0MB. Free memory was 170.4MB in the beginning and 145.8MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.29ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 143.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,504 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 195.0MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,504 INFO L158 Benchmark]: RCFGBuilder took 625.22ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 141.0MB in the beginning and 207.4MB in the end (delta: -66.4MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,504 INFO L158 Benchmark]: TraceAbstraction took 7615.55ms. Allocated memory was 234.9MB in the beginning and 413.1MB in the end (delta: 178.3MB). Free memory was 206.8MB in the beginning and 222.8MB in the end (delta: -15.9MB). Peak memory consumption was 161.8MB. Max. memory is 8.0GB. [2022-12-05 23:06:27,505 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.11ms. Allocated memory is still 195.0MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.72ms. Allocated memory is still 195.0MB. Free memory was 170.4MB in the beginning and 145.8MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.29ms. Allocated memory is still 195.0MB. Free memory was 145.8MB in the beginning and 143.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 195.0MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 625.22ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 141.0MB in the beginning and 207.4MB in the end (delta: -66.4MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7615.55ms. Allocated memory was 234.9MB in the beginning and 413.1MB in the end (delta: 178.3MB). Free memory was 206.8MB in the beginning and 222.8MB in the end (delta: -15.9MB). Peak memory consumption was 161.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 21 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 31 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 754, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 632, independent: 606, independent conditional: 0, independent unconditional: 606, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 632, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 796, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 632, unknown conditional: 0, unknown unconditional: 632] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 874, Positive conditional cache size: 0, Positive unconditional cache size: 874, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 57, independent conditional: 8, independent unconditional: 49, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 57, independent conditional: 8, independent unconditional: 49, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 57, independent conditional: 8, independent unconditional: 49, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 36, independent conditional: 5, independent unconditional: 31, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 89, dependent conditional: 13, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 55, unknown conditional: 7, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 37, Positive conditional cache size: 5, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 24, independent conditional: 5, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 24, independent conditional: 5, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 24, independent conditional: 5, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 40, Positive conditional cache size: 8, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 43, Positive conditional cache size: 8, Positive unconditional cache size: 35, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 31 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 51, Positive conditional cache size: 8, Positive unconditional cache size: 43, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 64, Positive conditional cache size: 10, Positive unconditional cache size: 54, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 29 PlacesBefore, 30 PlacesAfterwards, 15 TransitionsBefore, 16 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 11, Positive unconditional cache size: 57, Negative cache size: 22, Negative conditional cache size: 5, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 2 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:06:27,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...