/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:20:24,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:20:24,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:20:24,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:20:24,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:20:24,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:20:24,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:20:24,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:20:24,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:20:24,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:20:24,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:20:24,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:20:24,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:20:24,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:20:24,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:20:24,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:20:24,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:20:24,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:20:24,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:20:24,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:20:24,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:20:24,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:20:24,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:20:24,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:20:24,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:20:24,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:20:24,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:20:24,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:20:24,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:20:24,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:20:24,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:20:24,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:20:24,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:20:24,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:20:24,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:20:24,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:20:24,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:20:24,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:20:24,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:20:24,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:20:24,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:20:24,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:20:24,121 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:20:24,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:20:24,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:20:24,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:20:24,123 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:20:24,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:20:24,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:20:24,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:20:24,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:20:24,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:20:24,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:20:24,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:20:24,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:24,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:20:24,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:20:24,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:20:24,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:20:24,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:20:24,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:20:24,426 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:20:24,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:25,400 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:20:25,688 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:20:25,689 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:25,714 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1848fc48c/9e54d75cd58247738d8137fcad8f6127/FLAG234a41e77 [2022-12-05 23:20:25,743 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1848fc48c/9e54d75cd58247738d8137fcad8f6127 [2022-12-05 23:20:25,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:20:25,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:20:25,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:25,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:20:25,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:20:25,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:25" (1/1) ... [2022-12-05 23:20:25,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479e50e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:25, skipping insertion in model container [2022-12-05 23:20:25,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:25" (1/1) ... [2022-12-05 23:20:25,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:20:25,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:20:26,007 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-05 23:20:26,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:26,191 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:20:26,200 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-05 23:20:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:26,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:26,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:26,288 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:20:26,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26 WrapperNode [2022-12-05 23:20:26,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:26,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:26,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:20:26,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:20:26,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,343 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-05 23:20:26,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:26,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:20:26,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:20:26,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:20:26,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:20:26,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:20:26,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:20:26,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:20:26,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (1/1) ... [2022-12-05 23:20:26,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:20:26,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:20:26,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:20:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:20:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:20:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:20:26,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:20:26,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:20:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:20:26,466 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:20:26,552 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:20:26,553 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:20:26,786 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:20:26,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:20:26,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:20:26,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:26 BoogieIcfgContainer [2022-12-05 23:20:26,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:20:26,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:20:26,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:20:26,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:20:26,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:20:25" (1/3) ... [2022-12-05 23:20:26,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5c958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:26, skipping insertion in model container [2022-12-05 23:20:26,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:26" (2/3) ... [2022-12-05 23:20:26,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5c958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:26, skipping insertion in model container [2022-12-05 23:20:26,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:26" (3/3) ... [2022-12-05 23:20:26,893 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:26,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:20:26,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:20:26,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:20:26,935 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:20:26,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:26,990 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:26,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:26,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:20:26,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:26,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:26,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:27,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:27,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:27,032 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:27,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:27,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:20:27,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:27,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 23:20:30,822 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 23:20:30,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:20:30,837 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;@1636ac0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:20:30,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:20:30,840 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:20:30,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:30,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:30,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:20:30,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash 433341035, now seen corresponding path program 1 times [2022-12-05 23:20:30,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:30,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431164233] [2022-12-05 23:20:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:30,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:31,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431164233] [2022-12-05 23:20:31,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431164233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:31,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:31,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725527972] [2022-12-05 23:20:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:31,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:31,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:31,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 23:20:31,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:31,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:31,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 23:20:31,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:31,312 INFO L130 PetriNetUnfolder]: 879/1392 cut-off events. [2022-12-05 23:20:31,313 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:20:31,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 1392 events. 879/1392 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6476 event pairs, 240 based on Foata normal form. 0/1244 useless extension candidates. Maximal degree in co-relation 2748. Up to 1060 conditions per place. [2022-12-05 23:20:31,323 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-05 23:20:31,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-05 23:20:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 23:20:31,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-05 23:20:31,333 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-05 23:20:31,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-05 23:20:31,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:31,337 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-05 23:20:31,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-05 23:20:31,341 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 23:20:31,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:31,341 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-05 23:20:31,343 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:31,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:31,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-05 23:20:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:31,348 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:20:31,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:31,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:20:31,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:31,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 23:20:31,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:31,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-05 23:20:31,438 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:31,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:31,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:31,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:31,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:20:31,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1125650962, now seen corresponding path program 1 times [2022-12-05 23:20:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:31,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214161534] [2022-12-05 23:20:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:31,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214161534] [2022-12-05 23:20:31,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214161534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:31,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900985129] [2022-12-05 23:20:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:31,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:31,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:20:31,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:31,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:31,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:20:31,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:31,859 INFO L130 PetriNetUnfolder]: 1356/2082 cut-off events. [2022-12-05 23:20:31,859 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-05 23:20:31,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 2082 events. 1356/2082 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10072 event pairs, 498 based on Foata normal form. 86/2168 useless extension candidates. Maximal degree in co-relation 4349. Up to 1151 conditions per place. [2022-12-05 23:20:31,869 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-05 23:20:31,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2022-12-05 23:20:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:20:31,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-05 23:20:31,870 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:20:31,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2022-12-05 23:20:31,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:31,871 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-05 23:20:31,872 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-05 23:20:31,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:31,872 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,873 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:31,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:31,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,901 INFO L130 PetriNetUnfolder]: 48/164 cut-off events. [2022-12-05 23:20:31,901 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 23:20:31,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 164 events. 48/164 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 874 event pairs, 20 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 313. Up to 61 conditions per place. [2022-12-05 23:20:31,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-05 23:20:31,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:31,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-05 23:20:31,974 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-12-05 23:20:31,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:31,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:31,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:31,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:20:31,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash -535442361, now seen corresponding path program 1 times [2022-12-05 23:20:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:31,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862817924] [2022-12-05 23:20:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862817924] [2022-12-05 23:20:32,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862817924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:32,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:32,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578086287] [2022-12-05 23:20:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:32,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:32,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:32,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:20:32,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:32,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:32,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:20:32,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:32,268 INFO L130 PetriNetUnfolder]: 1188/1899 cut-off events. [2022-12-05 23:20:32,269 INFO L131 PetriNetUnfolder]: For 837/837 co-relation queries the response was YES. [2022-12-05 23:20:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 1899 events. 1188/1899 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9123 event pairs, 421 based on Foata normal form. 6/1905 useless extension candidates. Maximal degree in co-relation 4841. Up to 1706 conditions per place. [2022-12-05 23:20:32,300 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 30 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2022-12-05 23:20:32,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 206 flow [2022-12-05 23:20:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:20:32,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:20:32,301 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:20:32,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 206 flow [2022-12-05 23:20:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:32,304 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-05 23:20:32,305 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 23:20:32,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:32,305 INFO L89 Accepts]: Start accepts. Operand has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,305 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:32,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:32,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,316 INFO L130 PetriNetUnfolder]: 42/149 cut-off events. [2022-12-05 23:20:32,316 INFO L131 PetriNetUnfolder]: For 31/61 co-relation queries the response was YES. [2022-12-05 23:20:32,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 149 events. 42/149 cut-off events. For 31/61 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 766 event pairs, 11 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 287. Up to 53 conditions per place. [2022-12-05 23:20:32,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-05 23:20:32,319 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:32,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:20:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 121 flow [2022-12-05 23:20:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:32,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:32,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:20:32,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash -535442609, now seen corresponding path program 1 times [2022-12-05 23:20:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:32,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656031726] [2022-12-05 23:20:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656031726] [2022-12-05 23:20:32,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656031726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:32,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:32,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569525873] [2022-12-05 23:20:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:32,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:32,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:20:32,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 121 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:32,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:32,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:20:32,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:32,626 INFO L130 PetriNetUnfolder]: 1287/1975 cut-off events. [2022-12-05 23:20:32,626 INFO L131 PetriNetUnfolder]: For 603/603 co-relation queries the response was YES. [2022-12-05 23:20:32,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 1975 events. 1287/1975 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9147 event pairs, 126 based on Foata normal form. 5/1980 useless extension candidates. Maximal degree in co-relation 5031. Up to 1055 conditions per place. [2022-12-05 23:20:32,633 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 42 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2022-12-05 23:20:32,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 295 flow [2022-12-05 23:20:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:20:32,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:20:32,635 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 121 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:20:32,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 295 flow [2022-12-05 23:20:32,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:32,636 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-05 23:20:32,637 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-05 23:20:32,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:32,637 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,638 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:32,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:32,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,648 INFO L130 PetriNetUnfolder]: 35/129 cut-off events. [2022-12-05 23:20:32,648 INFO L131 PetriNetUnfolder]: For 125/158 co-relation queries the response was YES. [2022-12-05 23:20:32,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 129 events. 35/129 cut-off events. For 125/158 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 605 event pairs, 9 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 335. Up to 46 conditions per place. [2022-12-05 23:20:32,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-05 23:20:32,653 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:32,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:20:32,654 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 192 flow [2022-12-05 23:20:32,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:32,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:32,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:32,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:20:32,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash 581154838, now seen corresponding path program 1 times [2022-12-05 23:20:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:32,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005392869] [2022-12-05 23:20:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:32,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:32,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005392869] [2022-12-05 23:20:32,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005392869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:32,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:32,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679926716] [2022-12-05 23:20:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:32,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:32,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:20:32,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:32,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:32,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:20:32,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:32,960 INFO L130 PetriNetUnfolder]: 817/1418 cut-off events. [2022-12-05 23:20:32,960 INFO L131 PetriNetUnfolder]: For 1552/1585 co-relation queries the response was YES. [2022-12-05 23:20:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 1418 events. 817/1418 cut-off events. For 1552/1585 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7540 event pairs, 167 based on Foata normal form. 166/1575 useless extension candidates. Maximal degree in co-relation 3958. Up to 553 conditions per place. [2022-12-05 23:20:32,966 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2022-12-05 23:20:32,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 482 flow [2022-12-05 23:20:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 23:20:32,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-05 23:20:32,967 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 192 flow. Second operand 4 states and 51 transitions. [2022-12-05 23:20:32,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 482 flow [2022-12-05 23:20:32,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:20:32,971 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 230 flow [2022-12-05 23:20:32,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-05 23:20:32,972 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-05 23:20:32,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:32,972 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 230 flow [2022-12-05 23:20:32,972 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:32,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:32,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 230 flow [2022-12-05 23:20:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 230 flow [2022-12-05 23:20:32,997 INFO L130 PetriNetUnfolder]: 97/290 cut-off events. [2022-12-05 23:20:32,997 INFO L131 PetriNetUnfolder]: For 183/227 co-relation queries the response was YES. [2022-12-05 23:20:32,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 290 events. 97/290 cut-off events. For 183/227 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1774 event pairs, 29 based on Foata normal form. 2/252 useless extension candidates. Maximal degree in co-relation 775. Up to 164 conditions per place. [2022-12-05 23:20:32,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 230 flow [2022-12-05 23:20:33,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-05 23:20:33,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:33,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-05 23:20:33,198 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 232 flow [2022-12-05 23:20:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:33,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:33,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:33,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:20:33,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -794785837, now seen corresponding path program 1 times [2022-12-05 23:20:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:33,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328855412] [2022-12-05 23:20:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328855412] [2022-12-05 23:20:33,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328855412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:33,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:33,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406509165] [2022-12-05 23:20:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:33,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:33,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:33,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:33,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:33,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:33,454 INFO L130 PetriNetUnfolder]: 404/761 cut-off events. [2022-12-05 23:20:33,454 INFO L131 PetriNetUnfolder]: For 1080/1095 co-relation queries the response was YES. [2022-12-05 23:20:33,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 761 events. 404/761 cut-off events. For 1080/1095 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3712 event pairs, 72 based on Foata normal form. 95/849 useless extension candidates. Maximal degree in co-relation 2607. Up to 318 conditions per place. [2022-12-05 23:20:33,457 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 61 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2022-12-05 23:20:33,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 567 flow [2022-12-05 23:20:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-05 23:20:33,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2022-12-05 23:20:33,471 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 232 flow. Second operand 5 states and 64 transitions. [2022-12-05 23:20:33,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 567 flow [2022-12-05 23:20:33,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 557 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:33,476 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 271 flow [2022-12-05 23:20:33,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-05 23:20:33,477 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-05 23:20:33,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:33,478 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 271 flow [2022-12-05 23:20:33,478 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:33,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:33,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 271 flow [2022-12-05 23:20:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 271 flow [2022-12-05 23:20:33,518 INFO L130 PetriNetUnfolder]: 58/199 cut-off events. [2022-12-05 23:20:33,518 INFO L131 PetriNetUnfolder]: For 288/316 co-relation queries the response was YES. [2022-12-05 23:20:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 199 events. 58/199 cut-off events. For 288/316 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1050 event pairs, 5 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 653. Up to 95 conditions per place. [2022-12-05 23:20:33,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 271 flow [2022-12-05 23:20:33,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-05 23:20:33,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:33,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-05 23:20:33,632 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 275 flow [2022-12-05 23:20:33,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:33,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:33,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:20:33,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1546906546, now seen corresponding path program 1 times [2022-12-05 23:20:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:33,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731157047] [2022-12-05 23:20:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731157047] [2022-12-05 23:20:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731157047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:33,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:33,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736108192] [2022-12-05 23:20:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:33,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:20:33,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 275 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:33,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:33,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:20:33,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:33,872 INFO L130 PetriNetUnfolder]: 463/862 cut-off events. [2022-12-05 23:20:33,872 INFO L131 PetriNetUnfolder]: For 1850/1850 co-relation queries the response was YES. [2022-12-05 23:20:33,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 862 events. 463/862 cut-off events. For 1850/1850 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4121 event pairs, 75 based on Foata normal form. 9/871 useless extension candidates. Maximal degree in co-relation 3392. Up to 420 conditions per place. [2022-12-05 23:20:33,876 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 50 selfloop transitions, 13 changer transitions 15/78 dead transitions. [2022-12-05 23:20:33,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 646 flow [2022-12-05 23:20:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:20:33,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-05 23:20:33,877 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 275 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:20:33,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 646 flow [2022-12-05 23:20:33,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 584 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-05 23:20:33,884 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-05 23:20:33,884 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-05 23:20:33,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:33,885 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,885 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:33,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:33,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,903 INFO L130 PetriNetUnfolder]: 48/192 cut-off events. [2022-12-05 23:20:33,904 INFO L131 PetriNetUnfolder]: For 238/258 co-relation queries the response was YES. [2022-12-05 23:20:33,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 192 events. 48/192 cut-off events. For 238/258 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1014 event pairs, 6 based on Foata normal form. 11/199 useless extension candidates. Maximal degree in co-relation 582. Up to 85 conditions per place. [2022-12-05 23:20:33,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-05 23:20:33,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:33,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 23:20:33,907 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 278 flow [2022-12-05 23:20:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:33,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:33,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:33,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:20:33,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2100754224, now seen corresponding path program 1 times [2022-12-05 23:20:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:33,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118786354] [2022-12-05 23:20:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:34,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118786354] [2022-12-05 23:20:34,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118786354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:34,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:34,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073528002] [2022-12-05 23:20:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:34,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:34,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:20:34,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:34,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:34,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:20:34,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:34,109 INFO L130 PetriNetUnfolder]: 427/855 cut-off events. [2022-12-05 23:20:34,109 INFO L131 PetriNetUnfolder]: For 1659/1671 co-relation queries the response was YES. [2022-12-05 23:20:34,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 855 events. 427/855 cut-off events. For 1659/1671 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4508 event pairs, 199 based on Foata normal form. 14/861 useless extension candidates. Maximal degree in co-relation 3153. Up to 548 conditions per place. [2022-12-05 23:20:34,112 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 40 selfloop transitions, 3 changer transitions 6/52 dead transitions. [2022-12-05 23:20:34,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 442 flow [2022-12-05 23:20:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:20:34,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:20:34,113 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 278 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:20:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 442 flow [2022-12-05 23:20:34,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 416 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:34,116 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 247 flow [2022-12-05 23:20:34,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-05 23:20:34,116 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2022-12-05 23:20:34,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:34,116 INFO L89 Accepts]: Start accepts. Operand has 48 places, 36 transitions, 247 flow [2022-12-05 23:20:34,117 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:34,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:34,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 247 flow [2022-12-05 23:20:34,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 247 flow [2022-12-05 23:20:34,131 INFO L130 PetriNetUnfolder]: 44/189 cut-off events. [2022-12-05 23:20:34,131 INFO L131 PetriNetUnfolder]: For 278/296 co-relation queries the response was YES. [2022-12-05 23:20:34,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 189 events. 44/189 cut-off events. For 278/296 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1039 event pairs, 6 based on Foata normal form. 11/196 useless extension candidates. Maximal degree in co-relation 554. Up to 86 conditions per place. [2022-12-05 23:20:34,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 247 flow [2022-12-05 23:20:34,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-05 23:20:34,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L802-->L805: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0] and [353] $Ultimate##0-->L743: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 2 v_~z~0_9)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_9, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:20:34,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:34,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-05 23:20:34,150 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 252 flow [2022-12-05 23:20:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:34,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:34,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:34,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:20:34,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -721239064, now seen corresponding path program 1 times [2022-12-05 23:20:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:34,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993196066] [2022-12-05 23:20:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:34,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993196066] [2022-12-05 23:20:34,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993196066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:34,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:34,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:20:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099121212] [2022-12-05 23:20:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:20:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:20:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:20:34,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:34,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:34,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:34,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:34,411 INFO L130 PetriNetUnfolder]: 271/556 cut-off events. [2022-12-05 23:20:34,411 INFO L131 PetriNetUnfolder]: For 863/869 co-relation queries the response was YES. [2022-12-05 23:20:34,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 556 events. 271/556 cut-off events. For 863/869 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2777 event pairs, 71 based on Foata normal form. 40/587 useless extension candidates. Maximal degree in co-relation 1931. Up to 201 conditions per place. [2022-12-05 23:20:34,413 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 23 selfloop transitions, 11 changer transitions 25/60 dead transitions. [2022-12-05 23:20:34,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 485 flow [2022-12-05 23:20:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:20:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:20:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-05 23:20:34,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-05 23:20:34,414 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 252 flow. Second operand 6 states and 58 transitions. [2022-12-05 23:20:34,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 485 flow [2022-12-05 23:20:34,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 455 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:34,416 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 166 flow [2022-12-05 23:20:34,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-05 23:20:34,417 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2022-12-05 23:20:34,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:34,417 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 166 flow [2022-12-05 23:20:34,417 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:34,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:34,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 166 flow [2022-12-05 23:20:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 25 transitions, 166 flow [2022-12-05 23:20:34,421 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-05 23:20:34,421 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-05 23:20:34,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 28 events. 5/28 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 89. Up to 11 conditions per place. [2022-12-05 23:20:34,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 25 transitions, 166 flow [2022-12-05 23:20:34,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-05 23:20:34,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L812-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [423] L834-3-->L837: Formula: (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_27|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:20:34,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L792-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res#1.offset_11| 0) (= |v_P1Thread1of1ForFork2_#res#1.base_11| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P1Thread1of1ForFork2_#res#1.base=|v_P1Thread1of1ForFork2_#res#1.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork2_#res#1.offset=|v_P1Thread1of1ForFork2_#res#1.offset_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res#1.offset] and [423] L834-3-->L837: Formula: (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_27|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:20:34,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [413] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [423] L834-3-->L837: Formula: (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_27|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:20:35,373 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:20:35,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 957 [2022-12-05 23:20:35,374 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 20 transitions, 160 flow [2022-12-05 23:20:35,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:35,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:35,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:35,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:20:35,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -154616812, now seen corresponding path program 1 times [2022-12-05 23:20:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482788373] [2022-12-05 23:20:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482788373] [2022-12-05 23:20:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482788373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:35,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:35,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14612013] [2022-12-05 23:20:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:35,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:20:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:20:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:20:35,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:20:35,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 20 transitions, 160 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:35,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:35,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:20:35,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:35,832 INFO L130 PetriNetUnfolder]: 42/95 cut-off events. [2022-12-05 23:20:35,833 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-05 23:20:35,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 95 events. 42/95 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 276 event pairs, 0 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 376. Up to 48 conditions per place. [2022-12-05 23:20:35,833 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 28 selfloop transitions, 5 changer transitions 12/45 dead transitions. [2022-12-05 23:20:35,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 408 flow [2022-12-05 23:20:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:20:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:20:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-12-05 23:20:35,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2022-12-05 23:20:35,834 INFO L175 Difference]: Start difference. First operand has 45 places, 20 transitions, 160 flow. Second operand 7 states and 38 transitions. [2022-12-05 23:20:35,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 408 flow [2022-12-05 23:20:35,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 247 flow, removed 18 selfloop flow, removed 19 redundant places. [2022-12-05 23:20:35,836 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 101 flow [2022-12-05 23:20:35,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 23:20:35,837 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-05 23:20:35,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:35,838 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 101 flow [2022-12-05 23:20:35,839 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:35,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:35,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 101 flow [2022-12-05 23:20:35,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 101 flow [2022-12-05 23:20:35,844 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2022-12-05 23:20:35,844 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:20:35,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 35 events. 9/35 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 68 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 77. Up to 10 conditions per place. [2022-12-05 23:20:35,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 101 flow [2022-12-05 23:20:35,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-05 23:20:35,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:35,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:20:35,847 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 101 flow [2022-12-05 23:20:35,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:35,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:35,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:35,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:20:35,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash 187410537, now seen corresponding path program 1 times [2022-12-05 23:20:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:35,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669286350] [2022-12-05 23:20:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:20:35,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:20:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:20:35,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:20:35,968 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:20:35,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:20:35,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:20:35,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:20:35,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:20:35,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:20:35,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:20:35,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:20:35,972 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:35,977 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:20:35,977 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:20:36,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:20:36 BasicIcfg [2022-12-05 23:20:36,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:20:36,046 INFO L158 Benchmark]: Toolchain (without parser) took 10290.56ms. Allocated memory was 175.1MB in the beginning and 411.0MB in the end (delta: 235.9MB). Free memory was 149.1MB in the beginning and 258.0MB in the end (delta: -108.9MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,046 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:20:36,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.06ms. Allocated memory is still 175.1MB. Free memory was 149.1MB in the beginning and 122.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.48ms. Allocated memory is still 175.1MB. Free memory was 122.9MB in the beginning and 120.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,046 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 175.1MB. Free memory was 120.2MB in the beginning and 118.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,047 INFO L158 Benchmark]: RCFGBuilder took 513.54ms. Allocated memory is still 175.1MB. Free memory was 118.7MB in the beginning and 86.2MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,047 INFO L158 Benchmark]: TraceAbstraction took 9156.24ms. Allocated memory was 175.1MB in the beginning and 411.0MB in the end (delta: 235.9MB). Free memory was 85.6MB in the beginning and 258.0MB in the end (delta: -172.4MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-12-05 23:20:36,048 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.09ms. Allocated memory is still 175.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.06ms. Allocated memory is still 175.1MB. Free memory was 149.1MB in the beginning and 122.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.48ms. Allocated memory is still 175.1MB. Free memory was 122.9MB in the beginning and 120.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 175.1MB. Free memory was 120.2MB in the beginning and 118.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 513.54ms. Allocated memory is still 175.1MB. Free memory was 118.7MB in the beginning and 86.2MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9156.24ms. Allocated memory was 175.1MB in the beginning and 411.0MB in the end (delta: 235.9MB). Free memory was 85.6MB in the beginning and 258.0MB in the end (delta: -172.4MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 111 PlacesBefore, 35 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 1282, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1332, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 1678, Positive cache size: 1645, Positive conditional cache size: 0, Positive unconditional cache size: 1645, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 6, independent unconditional: 65, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 71, independent conditional: 6, independent unconditional: 65, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 6, independent unconditional: 65, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84, independent: 65, independent conditional: 6, independent unconditional: 59, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 84, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 79, dependent conditional: 14, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 84, unknown conditional: 9, unknown unconditional: 75] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 65, Positive conditional cache size: 6, Positive unconditional cache size: 59, Negative cache size: 19, Negative conditional cache size: 3, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 15, independent unconditional: 25, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 71, Positive conditional cache size: 6, Positive unconditional cache size: 65, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 56, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 73, Positive conditional cache size: 6, Positive unconditional cache size: 67, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 71, independent conditional: 29, independent unconditional: 42, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 90, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 77, Positive conditional cache size: 6, Positive unconditional cache size: 71, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 116, independent conditional: 116, 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: 152, independent: 116, independent conditional: 81, independent unconditional: 35, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 116, independent conditional: 24, independent unconditional: 92, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 116, independent conditional: 24, independent unconditional: 92, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 112, independent conditional: 24, independent unconditional: 88, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 85, Positive conditional cache size: 6, Positive unconditional cache size: 79, Negative cache size: 28, Negative conditional cache size: 3, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 131, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 40, dependent conditional: 4, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 91, independent conditional: 46, independent unconditional: 45, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 91, independent conditional: 46, independent unconditional: 45, dependent: 44, dependent conditional: 0, dependent unconditional: 44, 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: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 88, independent conditional: 43, independent unconditional: 45, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 92, Positive conditional cache size: 9, Positive unconditional cache size: 83, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 30, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 95, Positive conditional cache size: 9, Positive unconditional cache size: 86, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 43, independent conditional: 15, independent unconditional: 28, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 75, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 111, Positive conditional cache size: 10, Positive unconditional cache size: 101, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 50 PlacesBefore, 45 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 52, independent conditional: 50, independent unconditional: 2, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 52, independent conditional: 48, independent unconditional: 4, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 52, independent conditional: 48, independent unconditional: 4, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 5, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 76, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 151, Positive conditional cache size: 15, Positive unconditional cache size: 136, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 151, Positive conditional cache size: 15, Positive unconditional cache size: 136, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-3, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-2, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=-1, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 y = 2 [L804] 3 z = 1 [L742] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 1 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 1 !(!cond) [L838] RET 1 assume_abort_if_not(main$tmp_guard0) [L840] 1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L849] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 1 !expression [L19] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 19]: 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: 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: 830]: 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: 832]: 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, 132 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: 9.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 522 IncrementalHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 10 mSDtfsCounter, 522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=7, 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.2s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 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-05 23:20:36,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...