/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:04:00,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:04:00,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:04:00,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:04:00,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:04:00,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:04:00,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:04:00,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:04:00,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:04:00,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:04:00,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:04:00,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:04:00,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:04:00,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:04:00,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:04:00,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:04:00,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:04:00,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:04:00,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:04:00,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:04:00,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:04:00,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:04:00,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:04:00,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:04:00,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:04:00,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:04:00,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:04:00,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:04:00,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:04:00,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:04:00,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:04:00,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:04:00,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:04:00,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:04:00,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:04:00,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:04:00,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:04:00,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:04:00,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:04:00,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:04:00,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:04:00,099 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:04:00,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:04:00,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:04:00,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:04:00,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:04:00,126 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:04:00,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:04:00,127 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:04:00,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:04:00,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:04:00,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:04:00,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:04:00,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:04:00,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:04:00,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:04:00,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:04:00,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:00,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:04:00,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:04:00,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:04:00,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:04:00,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:04:00,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:04:00,130 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-13 12:04:00,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:04:00,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:04:00,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:04:00,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:04:00,458 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:04:00,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 12:04:01,570 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:04:01,797 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:04:01,797 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 12:04:01,832 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe7394f5/aff968c68a164bc491c435163f4a571b/FLAG251846c55 [2022-12-13 12:04:01,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe7394f5/aff968c68a164bc491c435163f4a571b [2022-12-13 12:04:01,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:04:01,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:04:01,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:01,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:04:01,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:04:01,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:01" (1/1) ... [2022-12-13 12:04:01,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5113eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:01, skipping insertion in model container [2022-12-13 12:04:01,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:04:01" (1/1) ... [2022-12-13 12:04:01,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:04:01,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:04:02,032 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 12:04:02,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:02,184 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:04:02,192 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 12:04:02,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:04:02,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:04:02,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:04:02,283 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:04:02,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02 WrapperNode [2022-12-13 12:04:02,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:04:02,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:02,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:04:02,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:04:02,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,326 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 12:04:02,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:04:02,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:04:02,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:04:02,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:04:02,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:04:02,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:04:02,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:04:02,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:04:02,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (1/1) ... [2022-12-13 12:04:02,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:04:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:04:02,394 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-13 12:04:02,410 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-13 12:04:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:04:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:04:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:04:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:04:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:04:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:04:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:04:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:04:02,428 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:04:02,535 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:04:02,536 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:04:02,876 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:04:02,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:04:02,963 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:04:02,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:04:02 BoogieIcfgContainer [2022-12-13 12:04:02,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:04:02,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:04:02,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:04:02,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:04:02,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:04:01" (1/3) ... [2022-12-13 12:04:02,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9da764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:04:02, skipping insertion in model container [2022-12-13 12:04:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:04:02" (2/3) ... [2022-12-13 12:04:02,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9da764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:04:02, skipping insertion in model container [2022-12-13 12:04:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:04:02" (3/3) ... [2022-12-13 12:04:02,972 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 12:04:02,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:04:02,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:04:02,985 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:04:03,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:04:03,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 12:04:03,114 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 12:04:03,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:03,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 12:04:03,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 12:04:03,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:03,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:03,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:03,207 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 12:04:03,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:03,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 12:04:03,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 12:04:03,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 12:04:07,338 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 12:04:07,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:04:07,365 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;@388c1e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:04:07,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:04:07,367 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 12:04:07,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:07,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:07,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:04:07,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 508067, now seen corresponding path program 1 times [2022-12-13 12:04:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406133288] [2022-12-13 12:04:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:07,610 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-13 12:04:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406133288] [2022-12-13 12:04:07,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406133288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:07,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:07,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:04:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854645431] [2022-12-13 12:04:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:07,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:04:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:07,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:04:07,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:04:07,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-13 12:04:07,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 12:04:07,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:07,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-13 12:04:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:08,811 INFO L130 PetriNetUnfolder]: 9240/14512 cut-off events. [2022-12-13 12:04:08,812 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 12:04:08,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27750 conditions, 14512 events. 9240/14512 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 104635 event pairs, 2624 based on Foata normal form. 0/9050 useless extension candidates. Maximal degree in co-relation 27739. Up to 11165 conditions per place. [2022-12-13 12:04:08,853 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 59/108 dead transitions. [2022-12-13 12:04:08,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 423 flow [2022-12-13 12:04:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-12-13 12:04:08,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2022-12-13 12:04:08,863 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 141 flow. Second operand 3 states and 137 transitions. [2022-12-13 12:04:08,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 423 flow [2022-12-13 12:04:08,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:04:08,867 INFO L231 Difference]: Finished difference. Result has 72 places, 33 transitions, 76 flow [2022-12-13 12:04:08,868 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=72, PETRI_TRANSITIONS=33} [2022-12-13 12:04:08,871 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 12:04:08,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:08,871 INFO L89 Accepts]: Start accepts. Operand has 72 places, 33 transitions, 76 flow [2022-12-13 12:04:08,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:08,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:08,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 33 transitions, 76 flow [2022-12-13 12:04:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 12:04:08,879 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 12:04:08,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:04:08,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:04:08,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 12:04:08,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 12:04:09,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:09,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-13 12:04:09,058 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 12:04:09,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-13 12:04:09,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:09,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:09,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:04:09,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 100634364, now seen corresponding path program 1 times [2022-12-13 12:04:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:09,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573114993] [2022-12-13 12:04:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:09,232 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-13 12:04:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573114993] [2022-12-13 12:04:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573114993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:09,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:09,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:04:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313859338] [2022-12-13 12:04:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:09,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:04:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:04:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:04:09,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 12:04:09,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 12:04:09,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:09,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 12:04:09,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:09,690 INFO L130 PetriNetUnfolder]: 3323/5210 cut-off events. [2022-12-13 12:04:09,690 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-13 12:04:09,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10383 conditions, 5210 events. 3323/5210 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31195 event pairs, 1027 based on Foata normal form. 0/4152 useless extension candidates. Maximal degree in co-relation 10373. Up to 3143 conditions per place. [2022-12-13 12:04:09,709 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 36 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2022-12-13 12:04:09,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 204 flow [2022-12-13 12:04:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 12:04:09,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 12:04:09,711 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 71 transitions. [2022-12-13 12:04:09,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 204 flow [2022-12-13 12:04:09,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:09,712 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2022-12-13 12:04:09,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 12:04:09,713 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -31 predicate places. [2022-12-13 12:04:09,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:09,713 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 108 flow [2022-12-13 12:04:09,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:09,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:09,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 108 flow [2022-12-13 12:04:09,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 108 flow [2022-12-13 12:04:09,727 INFO L130 PetriNetUnfolder]: 24/165 cut-off events. [2022-12-13 12:04:09,727 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 12:04:09,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 165 events. 24/165 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 957 event pairs, 10 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 246. Up to 45 conditions per place. [2022-12-13 12:04:09,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 108 flow [2022-12-13 12:04:09,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 12:04:09,763 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:09,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 12:04:09,765 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 108 flow [2022-12-13 12:04:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 12:04:09,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:09,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:04:09,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1175302277, now seen corresponding path program 1 times [2022-12-13 12:04:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:09,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443651504] [2022-12-13 12:04:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:09,908 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-13 12:04:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:09,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443651504] [2022-12-13 12:04:09,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443651504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:09,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:09,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:04:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439824758] [2022-12-13 12:04:09,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:09,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:09,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 12:04:09,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-13 12:04:09,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:09,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 12:04:09,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:10,238 INFO L130 PetriNetUnfolder]: 2518/4019 cut-off events. [2022-12-13 12:04:10,239 INFO L131 PetriNetUnfolder]: For 1119/1119 co-relation queries the response was YES. [2022-12-13 12:04:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 4019 events. 2518/4019 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23171 event pairs, 450 based on Foata normal form. 24/3338 useless extension candidates. Maximal degree in co-relation 9101. Up to 2109 conditions per place. [2022-12-13 12:04:10,255 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 43 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2022-12-13 12:04:10,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 258 flow [2022-12-13 12:04:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 12:04:10,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 12:04:10,257 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 108 flow. Second operand 4 states and 84 transitions. [2022-12-13 12:04:10,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 258 flow [2022-12-13 12:04:10,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:10,261 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 12:04:10,262 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2022-12-13 12:04:10,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:10,262 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:10,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:10,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,271 INFO L130 PetriNetUnfolder]: 21/145 cut-off events. [2022-12-13 12:04:10,272 INFO L131 PetriNetUnfolder]: For 42/49 co-relation queries the response was YES. [2022-12-13 12:04:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 145 events. 21/145 cut-off events. For 42/49 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 801 event pairs, 4 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 249. Up to 40 conditions per place. [2022-12-13 12:04:10,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 680 [2022-12-13 12:04:10,296 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:10,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 12:04:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 136 flow [2022-12-13 12:04:10,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-13 12:04:10,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:10,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:10,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:04:10,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1175305098, now seen corresponding path program 1 times [2022-12-13 12:04:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:10,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495083490] [2022-12-13 12:04:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:10,364 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-13 12:04:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495083490] [2022-12-13 12:04:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495083490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:10,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:10,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:04:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046878209] [2022-12-13 12:04:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:04:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:04:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:04:10,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 12:04:10,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:04:10,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:10,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 12:04:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:10,670 INFO L130 PetriNetUnfolder]: 2459/3947 cut-off events. [2022-12-13 12:04:10,670 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-13 12:04:10,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9456 conditions, 3947 events. 2459/3947 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22848 event pairs, 1365 based on Foata normal form. 10/3271 useless extension candidates. Maximal degree in co-relation 9441. Up to 3587 conditions per place. [2022-12-13 12:04:10,686 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 39 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-13 12:04:10,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 278 flow [2022-12-13 12:04:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 12:04:10,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 12:04:10,688 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 136 flow. Second operand 3 states and 65 transitions. [2022-12-13 12:04:10,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 278 flow [2022-12-13 12:04:10,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:10,691 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 12:04:10,692 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-13 12:04:10,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:10,692 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:10,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:10,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,701 INFO L130 PetriNetUnfolder]: 15/123 cut-off events. [2022-12-13 12:04:10,701 INFO L131 PetriNetUnfolder]: For 62/79 co-relation queries the response was YES. [2022-12-13 12:04:10,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 123 events. 15/123 cut-off events. For 62/79 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 631 event pairs, 3 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 232. Up to 32 conditions per place. [2022-12-13 12:04:10,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-13 12:04:10,704 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:10,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:04:10,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 174 flow [2022-12-13 12:04:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:04:10,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:10,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:10,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:04:10,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2074635305, now seen corresponding path program 1 times [2022-12-13 12:04:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506558824] [2022-12-13 12:04:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:10,771 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-13 12:04:10,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:10,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506558824] [2022-12-13 12:04:10,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506558824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:10,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:10,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:04:10,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468177469] [2022-12-13 12:04:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:10,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:10,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 12:04:10,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:04:10,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:10,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 12:04:10,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:11,217 INFO L130 PetriNetUnfolder]: 3700/5942 cut-off events. [2022-12-13 12:04:11,217 INFO L131 PetriNetUnfolder]: For 3796/3899 co-relation queries the response was YES. [2022-12-13 12:04:11,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 5942 events. 3700/5942 cut-off events. For 3796/3899 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 37209 event pairs, 674 based on Foata normal form. 201/5067 useless extension candidates. Maximal degree in co-relation 13701. Up to 2293 conditions per place. [2022-12-13 12:04:11,233 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 39 selfloop transitions, 4 changer transitions 16/70 dead transitions. [2022-12-13 12:04:11,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 376 flow [2022-12-13 12:04:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 12:04:11,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 12:04:11,234 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 174 flow. Second operand 4 states and 87 transitions. [2022-12-13 12:04:11,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 376 flow [2022-12-13 12:04:11,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 369 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:11,238 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 154 flow [2022-12-13 12:04:11,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-13 12:04:11,239 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -22 predicate places. [2022-12-13 12:04:11,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:11,239 INFO L89 Accepts]: Start accepts. Operand has 53 places, 37 transitions, 154 flow [2022-12-13 12:04:11,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:11,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:11,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 154 flow [2022-12-13 12:04:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 37 transitions, 154 flow [2022-12-13 12:04:11,246 INFO L130 PetriNetUnfolder]: 5/85 cut-off events. [2022-12-13 12:04:11,246 INFO L131 PetriNetUnfolder]: For 61/63 co-relation queries the response was YES. [2022-12-13 12:04:11,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 85 events. 5/85 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 352 event pairs, 2 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 161. Up to 16 conditions per place. [2022-12-13 12:04:11,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 154 flow [2022-12-13 12:04:11,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 12:04:11,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:11,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 12:04:11,320 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 156 flow [2022-12-13 12:04:11,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:04:11,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:11,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:11,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:04:11,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2143745407, now seen corresponding path program 1 times [2022-12-13 12:04:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194441907] [2022-12-13 12:04:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:11,398 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-13 12:04:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:11,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194441907] [2022-12-13 12:04:11,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194441907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:11,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:11,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316772079] [2022-12-13 12:04:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:11,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 12:04:11,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:11,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:11,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 12:04:11,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:12,086 INFO L130 PetriNetUnfolder]: 3410/5363 cut-off events. [2022-12-13 12:04:12,087 INFO L131 PetriNetUnfolder]: For 4470/4534 co-relation queries the response was YES. [2022-12-13 12:04:12,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13596 conditions, 5363 events. 3410/5363 cut-off events. For 4470/4534 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32146 event pairs, 256 based on Foata normal form. 391/3952 useless extension candidates. Maximal degree in co-relation 13576. Up to 2965 conditions per place. [2022-12-13 12:04:12,135 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 57 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2022-12-13 12:04:12,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 448 flow [2022-12-13 12:04:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 12:04:12,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-12-13 12:04:12,138 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 156 flow. Second operand 4 states and 89 transitions. [2022-12-13 12:04:12,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 448 flow [2022-12-13 12:04:12,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 401 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 12:04:12,145 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 12:04:12,147 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 12:04:12,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:12,148 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:12,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:12,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,237 INFO L130 PetriNetUnfolder]: 635/1148 cut-off events. [2022-12-13 12:04:12,238 INFO L131 PetriNetUnfolder]: For 223/254 co-relation queries the response was YES. [2022-12-13 12:04:12,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1148 events. 635/1148 cut-off events. For 223/254 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 7772 event pairs, 324 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 2573. Up to 976 conditions per place. [2022-12-13 12:04:12,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 12:04:12,254 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:12,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 12:04:12,255 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 211 flow [2022-12-13 12:04:12,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:12,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:12,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:12,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:04:12,255 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2050511728, now seen corresponding path program 1 times [2022-12-13 12:04:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:12,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056216322] [2022-12-13 12:04:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:12,397 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-13 12:04:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056216322] [2022-12-13 12:04:12,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056216322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:12,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:12,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:04:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899904146] [2022-12-13 12:04:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:12,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:04:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:04:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:04:12,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 12:04:12,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-13 12:04:12,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:12,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 12:04:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:12,707 INFO L130 PetriNetUnfolder]: 1988/3459 cut-off events. [2022-12-13 12:04:12,707 INFO L131 PetriNetUnfolder]: For 2202/2218 co-relation queries the response was YES. [2022-12-13 12:04:12,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10973 conditions, 3459 events. 1988/3459 cut-off events. For 2202/2218 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 21852 event pairs, 72 based on Foata normal form. 348/2699 useless extension candidates. Maximal degree in co-relation 10954. Up to 1855 conditions per place. [2022-12-13 12:04:12,721 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 66 selfloop transitions, 20 changer transitions 1/95 dead transitions. [2022-12-13 12:04:12,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 592 flow [2022-12-13 12:04:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:04:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:04:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 12:04:12,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.69375 [2022-12-13 12:04:12,723 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 211 flow. Second operand 5 states and 111 transitions. [2022-12-13 12:04:12,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 592 flow [2022-12-13 12:04:12,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 576 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:12,727 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 12:04:12,728 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -19 predicate places. [2022-12-13 12:04:12,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:12,728 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:12,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:12,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,773 INFO L130 PetriNetUnfolder]: 380/884 cut-off events. [2022-12-13 12:04:12,774 INFO L131 PetriNetUnfolder]: For 437/753 co-relation queries the response was YES. [2022-12-13 12:04:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 884 events. 380/884 cut-off events. For 437/753 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 6539 event pairs, 90 based on Foata normal form. 6/489 useless extension candidates. Maximal degree in co-relation 2876. Up to 673 conditions per place. [2022-12-13 12:04:12,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-13 12:04:12,792 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:12,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 12:04:12,793 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 323 flow [2022-12-13 12:04:12,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-13 12:04:12,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:12,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:12,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:04:12,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1637867723, now seen corresponding path program 1 times [2022-12-13 12:04:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:12,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848237408] [2022-12-13 12:04:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:12,956 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-13 12:04:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848237408] [2022-12-13 12:04:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848237408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:12,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:12,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:04:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069922522] [2022-12-13 12:04:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:12,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:04:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:04:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:04:12,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 12:04:12,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:12,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:12,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 12:04:12,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:13,161 INFO L130 PetriNetUnfolder]: 1004/1902 cut-off events. [2022-12-13 12:04:13,162 INFO L131 PetriNetUnfolder]: For 1933/1943 co-relation queries the response was YES. [2022-12-13 12:04:13,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 1902 events. 1004/1902 cut-off events. For 1933/1943 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11538 event pairs, 72 based on Foata normal form. 207/1493 useless extension candidates. Maximal degree in co-relation 7363. Up to 964 conditions per place. [2022-12-13 12:04:13,169 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 39 selfloop transitions, 29 changer transitions 2/78 dead transitions. [2022-12-13 12:04:13,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 564 flow [2022-12-13 12:04:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:04:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:04:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 12:04:13,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 12:04:13,171 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 323 flow. Second operand 6 states and 102 transitions. [2022-12-13 12:04:13,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 564 flow [2022-12-13 12:04:13,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 500 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 12:04:13,186 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 356 flow [2022-12-13 12:04:13,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2022-12-13 12:04:13,187 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 12:04:13,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:13,187 INFO L89 Accepts]: Start accepts. Operand has 58 places, 54 transitions, 356 flow [2022-12-13 12:04:13,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:13,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:13,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 356 flow [2022-12-13 12:04:13,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 356 flow [2022-12-13 12:04:13,212 INFO L130 PetriNetUnfolder]: 182/497 cut-off events. [2022-12-13 12:04:13,212 INFO L131 PetriNetUnfolder]: For 537/757 co-relation queries the response was YES. [2022-12-13 12:04:13,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 497 events. 182/497 cut-off events. For 537/757 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3368 event pairs, 0 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 2027. Up to 361 conditions per place. [2022-12-13 12:04:13,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 356 flow [2022-12-13 12:04:13,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-13 12:04:13,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L783-->L786: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:13,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L763-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork2_#res#1.offset_23| 0) (= |v_P0Thread1of1ForFork2_#res#1.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_23|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L763-->P0FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_14 1) v_~__unbuffered_cnt~0_13) (= |v_P0Thread1of1ForFork2_#res#1.offset_5| 0) (= |v_P0Thread1of1ForFork2_#res#1.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_5|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L763-->L766: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] L816-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L816-->L819: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:14,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L783-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P1Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:15,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L783-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [502] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd0~0_181 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_530 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_531 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_462 256) 0))))) (and (= v_~z$r_buff1_thd0~0_180 (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_461 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_183 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_181)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149| 0)) (= v_~z$w_buff0_used~0_530 (ite .cse2 0 v_~z$w_buff0_used~0_531)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| (mod v_~main$tmp_guard0~0_148 256)) (= v_~main$tmp_guard1~0_84 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_87 1) (= v_~x~0_99 2))) 1 0) 0) 0 1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_511 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= v_~z$r_buff0_thd0~0_183 (ite .cse3 0 v_~z$r_buff0_thd0~0_184)) (= v_~z~0_404 (ite .cse2 v_~z$w_buff0~0_327 (ite .cse4 v_~z$w_buff1~0_275 v_~z~0_405))) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_462) v_~z$w_buff1_used~0_461) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_531, ~z$w_buff0~0=v_~z$w_buff0~0_327, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_181, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_405, ~x~0=v_~x~0_99} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_93|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_530, ~z$w_buff0~0=v_~z$w_buff0~0_327, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_461, ~z$w_buff1~0=v_~z$w_buff1~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_180, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_149|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_87, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, ~z~0=v_~z~0_404, ~x~0=v_~x~0_99, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 12:04:15,271 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:04:15,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2084 [2022-12-13 12:04:15,272 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 366 flow [2022-12-13 12:04:15,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:15,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:15,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:15,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:04:15,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -582149279, now seen corresponding path program 1 times [2022-12-13 12:04:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:15,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380446564] [2022-12-13 12:04:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:16,235 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-13 12:04:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380446564] [2022-12-13 12:04:16,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380446564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:16,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:16,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:04:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984367648] [2022-12-13 12:04:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:16,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:04:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:04:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:04:16,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 12:04:16,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:16,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:16,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 12:04:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:16,822 INFO L130 PetriNetUnfolder]: 749/1539 cut-off events. [2022-12-13 12:04:16,822 INFO L131 PetriNetUnfolder]: For 3461/3573 co-relation queries the response was YES. [2022-12-13 12:04:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 1539 events. 749/1539 cut-off events. For 3461/3573 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 10519 event pairs, 131 based on Foata normal form. 72/1213 useless extension candidates. Maximal degree in co-relation 6644. Up to 607 conditions per place. [2022-12-13 12:04:16,828 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 67 selfloop transitions, 13 changer transitions 24/117 dead transitions. [2022-12-13 12:04:16,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 117 transitions, 1067 flow [2022-12-13 12:04:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:04:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:04:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-12-13 12:04:16,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6359649122807017 [2022-12-13 12:04:16,830 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 366 flow. Second operand 6 states and 145 transitions. [2022-12-13 12:04:16,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 117 transitions, 1067 flow [2022-12-13 12:04:16,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 117 transitions, 730 flow, removed 54 selfloop flow, removed 8 redundant places. [2022-12-13 12:04:16,850 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 380 flow [2022-12-13 12:04:16,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2022-12-13 12:04:16,850 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -19 predicate places. [2022-12-13 12:04:16,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:16,850 INFO L89 Accepts]: Start accepts. Operand has 56 places, 60 transitions, 380 flow [2022-12-13 12:04:16,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:16,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:16,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 60 transitions, 380 flow [2022-12-13 12:04:16,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 380 flow [2022-12-13 12:04:16,890 INFO L130 PetriNetUnfolder]: 177/477 cut-off events. [2022-12-13 12:04:16,890 INFO L131 PetriNetUnfolder]: For 797/861 co-relation queries the response was YES. [2022-12-13 12:04:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 477 events. 177/477 cut-off events. For 797/861 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 3357 event pairs, 3 based on Foata normal form. 32/198 useless extension candidates. Maximal degree in co-relation 1465. Up to 207 conditions per place. [2022-12-13 12:04:16,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 380 flow [2022-12-13 12:04:16,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 12:04:17,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:17,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1033 [2022-12-13 12:04:17,883 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 386 flow [2022-12-13 12:04:17,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:17,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:17,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:17,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:04:17,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 193008271, now seen corresponding path program 1 times [2022-12-13 12:04:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392627948] [2022-12-13 12:04:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:18,035 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-13 12:04:18,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:18,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392627948] [2022-12-13 12:04:18,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392627948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:18,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:18,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226771661] [2022-12-13 12:04:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:18,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:18,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:18,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:18,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:18,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2022-12-13 12:04:18,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:04:18,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:18,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2022-12-13 12:04:18,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:18,256 INFO L130 PetriNetUnfolder]: 739/1596 cut-off events. [2022-12-13 12:04:18,257 INFO L131 PetriNetUnfolder]: For 2085/2167 co-relation queries the response was YES. [2022-12-13 12:04:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5250 conditions, 1596 events. 739/1596 cut-off events. For 2085/2167 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 11329 event pairs, 199 based on Foata normal form. 121/1353 useless extension candidates. Maximal degree in co-relation 5240. Up to 841 conditions per place. [2022-12-13 12:04:18,261 INFO L137 encePairwiseOnDemand]: 25/41 looper letters, 36 selfloop transitions, 3 changer transitions 24/72 dead transitions. [2022-12-13 12:04:18,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 495 flow [2022-12-13 12:04:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 12:04:18,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2022-12-13 12:04:18,262 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 386 flow. Second operand 4 states and 93 transitions. [2022-12-13 12:04:18,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 495 flow [2022-12-13 12:04:18,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:18,265 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 252 flow [2022-12-13 12:04:18,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-12-13 12:04:18,266 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 12:04:18,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:18,266 INFO L89 Accepts]: Start accepts. Operand has 58 places, 42 transitions, 252 flow [2022-12-13 12:04:18,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:18,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:18,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 252 flow [2022-12-13 12:04:18,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 252 flow [2022-12-13 12:04:18,286 INFO L130 PetriNetUnfolder]: 64/171 cut-off events. [2022-12-13 12:04:18,287 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-12-13 12:04:18,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 171 events. 64/171 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 873 event pairs, 1 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 614. Up to 85 conditions per place. [2022-12-13 12:04:18,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 252 flow [2022-12-13 12:04:18,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 12:04:18,818 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:04:18,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-13 12:04:18,818 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 252 flow [2022-12-13 12:04:18,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:04:18,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:18,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:04:18,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:04:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1174983164, now seen corresponding path program 1 times [2022-12-13 12:04:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:18,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926419876] [2022-12-13 12:04:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:04:18,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:04:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:04:18,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:04:18,941 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:04:18,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:04:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:04:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:04:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:04:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:04:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:04:18,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:04:18,943 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:18,949 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:04:18,949 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:04:19,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:04:19 BasicIcfg [2022-12-13 12:04:19,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:04:19,017 INFO L158 Benchmark]: Toolchain (without parser) took 17165.73ms. Allocated memory was 195.0MB in the beginning and 940.6MB in the end (delta: 745.5MB). Free memory was 152.1MB in the beginning and 455.5MB in the end (delta: -303.4MB). Peak memory consumption was 442.6MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,017 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:04:19,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.57ms. Allocated memory is still 195.0MB. Free memory was 151.6MB in the beginning and 125.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.20ms. Allocated memory is still 195.0MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,018 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 195.0MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,018 INFO L158 Benchmark]: RCFGBuilder took 615.20ms. Allocated memory is still 195.0MB. Free memory was 121.2MB in the beginning and 86.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,018 INFO L158 Benchmark]: TraceAbstraction took 16044.63ms. Allocated memory was 195.0MB in the beginning and 940.6MB in the end (delta: 745.5MB). Free memory was 85.0MB in the beginning and 455.5MB in the end (delta: -370.5MB). Peak memory consumption was 375.5MB. Max. memory is 8.0GB. [2022-12-13 12:04:19,019 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.12ms. Allocated memory is still 195.0MB. Free memory is still 171.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.57ms. Allocated memory is still 195.0MB. Free memory was 151.6MB in the beginning and 125.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.20ms. Allocated memory is still 195.0MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 195.0MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.20ms. Allocated memory is still 195.0MB. Free memory was 121.2MB in the beginning and 86.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16044.63ms. Allocated memory was 195.0MB in the beginning and 940.6MB in the end (delta: 745.5MB). Free memory was 85.0MB in the beginning and 455.5MB in the end (delta: -370.5MB). Peak memory consumption was 375.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 113 PlacesBefore, 75 PlacesAfterwards, 105 TransitionsBefore, 66 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 4137, independent unconditional: 0, dependent: 124, dependent conditional: 124, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4261, independent: 4137, independent conditional: 0, independent unconditional: 4137, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2021, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2021, independent: 1937, independent conditional: 0, independent unconditional: 1937, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4261, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 2021, unknown conditional: 0, unknown unconditional: 2021] , Statistics on independence cache: Total cache size (in pairs): 3923, Positive cache size: 3878, Positive conditional cache size: 0, Positive unconditional cache size: 3878, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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.2s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289, independent: 253, independent conditional: 25, independent unconditional: 228, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 289, independent: 253, independent conditional: 25, independent unconditional: 228, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 289, independent: 253, independent conditional: 25, independent unconditional: 228, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 229, independent: 204, independent conditional: 23, independent unconditional: 181, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 229, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 153, dependent conditional: 122, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 289, independent: 49, independent conditional: 2, independent unconditional: 47, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 229, unknown conditional: 31, unknown unconditional: 198] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 204, Positive conditional cache size: 23, Positive unconditional cache size: 181, Negative cache size: 25, Negative conditional cache size: 8, 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, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 292, independent conditional: 27, independent unconditional: 265, dependent: 28, dependent conditional: 2, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 249, Positive conditional cache size: 23, Positive unconditional cache size: 226, Negative cache size: 30, Negative conditional cache size: 8, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 335, independent conditional: 335, 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: 368, independent: 335, independent conditional: 35, independent unconditional: 300, dependent: 33, dependent conditional: 4, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 335, independent conditional: 0, independent unconditional: 335, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 335, independent conditional: 0, independent unconditional: 335, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 368, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 260, Positive conditional cache size: 23, Positive unconditional cache size: 237, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 432, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 432, independent: 395, independent conditional: 25, independent unconditional: 370, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 432, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 432, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 432, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 264, Positive conditional cache size: 23, Positive unconditional cache size: 241, Negative cache size: 33, Negative conditional cache size: 8, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 52 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 534, independent: 475, independent conditional: 475, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 534, independent: 475, independent conditional: 67, independent unconditional: 408, dependent: 59, dependent conditional: 9, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 534, independent: 475, independent conditional: 0, independent unconditional: 475, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 534, independent: 475, independent conditional: 0, independent unconditional: 475, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 534, independent: 471, independent conditional: 0, independent unconditional: 471, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 294, Positive conditional cache size: 27, Positive unconditional cache size: 267, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 11, independent unconditional: 103, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 142, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 297, Positive conditional cache size: 27, Positive unconditional cache size: 270, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 146, independent conditional: 23, independent unconditional: 123, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 146, independent conditional: 20, independent unconditional: 126, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, independent: 146, independent conditional: 20, independent unconditional: 126, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 184, independent: 144, independent conditional: 18, independent unconditional: 126, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 299, Positive conditional cache size: 29, Positive unconditional cache size: 270, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 58 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 48 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 308, independent conditional: 308, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 379, independent: 308, independent conditional: 81, independent unconditional: 227, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 379, independent: 308, independent conditional: 66, independent unconditional: 242, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 379, independent: 308, independent conditional: 66, independent unconditional: 242, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 33, independent unconditional: 6, 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: 39, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 379, independent: 269, independent conditional: 33, independent unconditional: 236, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 39, unknown conditional: 33, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 349, Positive conditional cache size: 62, Positive unconditional cache size: 287, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 55 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 105, independent conditional: 99, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 105, independent conditional: 93, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 105, independent conditional: 93, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 102, independent conditional: 90, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 355, Positive conditional cache size: 65, Positive unconditional cache size: 290, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 55 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 89, independent conditional: 89, 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: 89, independent: 89, independent conditional: 89, 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: 89, independent: 89, independent conditional: 77, independent unconditional: 12, 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: 89, independent: 89, independent conditional: 77, independent unconditional: 12, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 89, independent: 87, independent conditional: 77, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 446, Positive conditional cache size: 65, Positive unconditional cache size: 381, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2281, ((void *)0), P0, ((void *)0))=-2, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2282, ((void *)0), P1, ((void *)0))=-1, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2283, ((void *)0), P2, ((void *)0))=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L842] RET 3 assume_abort_if_not(main$tmp_guard0) [L844] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 3 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 838]: 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: 834]: 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: 836]: 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 7 procedures, 135 locations, 6 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: 15.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 965 IncrementalHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 5 mSDtfsCounter, 965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=9, InterpolantAutomatonStates: 42, 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.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 1323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 12:04:19,066 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...