/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:29:13,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:29:13,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:29:13,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:29:13,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:29:13,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:29:13,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:29:13,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:29:13,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:29:13,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:29:13,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:29:13,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:29:13,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:29:13,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:29:13,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:29:13,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:29:13,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:29:13,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:29:13,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:29:13,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:29:13,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:29:13,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:29:13,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:29:13,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:29:13,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:29:13,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:29:13,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:29:13,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:29:13,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:29:13,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:29:13,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:29:13,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:29:13,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:29:13,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:29:13,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:29:13,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:29:13,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:29:13,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:29:13,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:29:13,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:29:13,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:29:13,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:29:13,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:29:13,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:29:13,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:29:13,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:29:13,267 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:29:13,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:29:13,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:29:13,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:29:13,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:29:13,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:29:13,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:29:13,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:29:13,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:29:13,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:29:13,278 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:29:13,278 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-06 07:29:13,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:29:13,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:29:13,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:29:13,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:29:13,533 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:29:13,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2022-12-06 07:29:14,418 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:29:14,605 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:29:14,606 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2022-12-06 07:29:14,610 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319592a3f/16af3fb691954755a66ffd6d3c933e0b/FLAGf239a3dde [2022-12-06 07:29:14,622 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319592a3f/16af3fb691954755a66ffd6d3c933e0b [2022-12-06 07:29:14,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:29:14,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:29:14,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:29:14,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:29:14,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:29:14,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119f5e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14, skipping insertion in model container [2022-12-06 07:29:14,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:29:14,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:29:14,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2950,2963] [2022-12-06 07:29:14,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:29:14,805 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:29:14,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:29:14,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:29:14,837 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2950,2963] [2022-12-06 07:29:14,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:29:14,849 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:29:14,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14 WrapperNode [2022-12-06 07:29:14,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:29:14,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:29:14,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:29:14,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:29:14,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,883 INFO L138 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-12-06 07:29:14,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:29:14,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:29:14,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:29:14,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:29:14,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,909 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:29:14,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:29:14,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:29:14,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:29:14,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (1/1) ... [2022-12-06 07:29:14,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:29:14,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:14,938 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-06 07:29:14,946 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-06 07:29:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:29:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:29:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:29:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:29:14,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:29:14,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:29:14,977 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:29:15,069 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:29:15,071 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:29:15,284 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:29:15,321 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:29:15,321 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:29:15,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:29:15 BoogieIcfgContainer [2022-12-06 07:29:15,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:29:15,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:29:15,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:29:15,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:29:15,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:29:14" (1/3) ... [2022-12-06 07:29:15,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac56e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:29:15, skipping insertion in model container [2022-12-06 07:29:15,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:29:14" (2/3) ... [2022-12-06 07:29:15,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac56e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:29:15, skipping insertion in model container [2022-12-06 07:29:15,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:29:15" (3/3) ... [2022-12-06 07:29:15,328 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2022-12-06 07:29:15,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:29:15,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:29:15,347 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:29:15,433 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:29:15,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 99 transitions, 222 flow [2022-12-06 07:29:15,502 INFO L130 PetriNetUnfolder]: 7/96 cut-off events. [2022-12-06 07:29:15,502 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 96 events. 7/96 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-06 07:29:15,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 99 transitions, 222 flow [2022-12-06 07:29:15,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 86 transitions, 190 flow [2022-12-06 07:29:15,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 86 transitions, 190 flow [2022-12-06 07:29:15,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 86 transitions, 190 flow [2022-12-06 07:29:15,565 INFO L130 PetriNetUnfolder]: 7/86 cut-off events. [2022-12-06 07:29:15,565 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:15,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 7/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-06 07:29:15,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 86 transitions, 190 flow [2022-12-06 07:29:15,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 1134 [2022-12-06 07:29:18,029 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-06 07:29:18,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:29:18,043 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;@7ff1bf35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:29:18,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:29:18,047 INFO L130 PetriNetUnfolder]: 2/21 cut-off events. [2022-12-06 07:29:18,047 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:29:18,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1654229288, now seen corresponding path program 1 times [2022-12-06 07:29:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302476699] [2022-12-06 07:29:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,404 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-06 07:29:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302476699] [2022-12-06 07:29:18,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302476699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555957111] [2022-12-06 07:29:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:18,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:29:18,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-06 07:29:18,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:29:18,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,585 INFO L130 PetriNetUnfolder]: 433/696 cut-off events. [2022-12-06 07:29:18,585 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-06 07:29:18,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 696 events. 433/696 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2620 event pairs, 74 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1212. Up to 359 conditions per place. [2022-12-06 07:29:18,590 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 55 selfloop transitions, 5 changer transitions 22/82 dead transitions. [2022-12-06 07:29:18,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 82 transitions, 382 flow [2022-12-06 07:29:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:29:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:29:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 07:29:18,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 07:29:18,599 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 62 flow. Second operand 7 states and 84 transitions. [2022-12-06 07:29:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 82 transitions, 382 flow [2022-12-06 07:29:18,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 82 transitions, 346 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:18,604 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:18,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 07:29:18,609 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 07:29:18,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,609 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:18,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 99 flow [2022-12-06 07:29:18,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:18,632 INFO L130 PetriNetUnfolder]: 30/99 cut-off events. [2022-12-06 07:29:18,632 INFO L131 PetriNetUnfolder]: For 75/82 co-relation queries the response was YES. [2022-12-06 07:29:18,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 99 events. 30/99 cut-off events. For 75/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 339 event pairs, 4 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 173. Up to 37 conditions per place. [2022-12-06 07:29:18,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:18,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 07:29:18,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:18,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 07:29:18,642 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 99 flow [2022-12-06 07:29:18,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-06 07:29:18,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:29:18,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 661328540, now seen corresponding path program 2 times [2022-12-06 07:29:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79970617] [2022-12-06 07:29:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,773 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-06 07:29:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79970617] [2022-12-06 07:29:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79970617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536496635] [2022-12-06 07:29:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:29:18,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-06 07:29:18,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:29:18,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,878 INFO L130 PetriNetUnfolder]: 260/443 cut-off events. [2022-12-06 07:29:18,878 INFO L131 PetriNetUnfolder]: For 497/497 co-relation queries the response was YES. [2022-12-06 07:29:18,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 443 events. 260/443 cut-off events. For 497/497 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1585 event pairs, 21 based on Foata normal form. 32/475 useless extension candidates. Maximal degree in co-relation 940. Up to 239 conditions per place. [2022-12-06 07:29:18,880 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 40 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-06 07:29:18,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 280 flow [2022-12-06 07:29:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:29:18,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 07:29:18,881 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 99 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:29:18,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 280 flow [2022-12-06 07:29:18,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 265 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,883 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:18,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-06 07:29:18,884 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 07:29:18,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,884 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:18,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:18,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:18,892 INFO L130 PetriNetUnfolder]: 34/108 cut-off events. [2022-12-06 07:29:18,892 INFO L131 PetriNetUnfolder]: For 89/98 co-relation queries the response was YES. [2022-12-06 07:29:18,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 108 events. 34/108 cut-off events. For 89/98 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 365 event pairs, 5 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 223. Up to 42 conditions per place. [2022-12-06 07:29:18,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 124 flow [2022-12-06 07:29:18,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 07:29:18,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [339] L59-->L54: Formula: (let ((.cse0 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_In_3 256) 0))) (.cse1 (= (mod v_~d1~0_In_6 256) 0))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_6| |v_thread1Thread1of1ForFork0_#t~post1_In_2|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_26 1))) (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_26) (= |v_thread1Thread1of1ForFork0_#t~post2_In_2| |v_thread1Thread1of1ForFork0_#t~post2_Out_6|) (not .cse1)))) InVars {~pos~0=v_~pos~0_In_12, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_2|, ~d1~0=v_~d1~0_In_6} OutVars{~pos~0=v_~pos~0_Out_26, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_6|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_6|, ~d1~0=v_~d1~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0] [2022-12-06 07:29:18,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 v_thread1Thread1of1ForFork0_~lv_assert~0_1) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0] and [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-06 07:29:19,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] $Ultimate##0-->L59: Formula: (= v_~v_assert~0_1 v_thread1Thread1of1ForFork0_~lv_assert~0_1) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0] and [341] $Ultimate##0-->L54: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_22| 0) (= |v_thread3Thread1of1ForFork2_#res.offset_22| 0) (let ((.cse0 (= (mod v_~d1~0_68 256) 0)) (.cse1 (not (= 0 (mod v_thread1Thread1of1ForFork0_~lv_assert~0_32 256))))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_16| |v_thread1Thread1of1ForFork0_#t~post2_15|) (not .cse0) (= v_~pos~0_141 (+ v_~pos~0_142 1)) .cse1) (and .cse0 (= |v_thread1Thread1of1ForFork0_#t~post1_20| |v_thread1Thread1of1ForFork0_#t~post1_19|) .cse1 (= v_~pos~0_142 (+ v_~pos~0_141 1))))) (= (ite (= (ite (<= 0 v_~pos~0_142) 1 0) 0) 0 1) v_~v_assert~0_83)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_20|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_32, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_16|, ~pos~0=v_~pos~0_142, ~d1~0=v_~d1~0_68} OutVars{~v_assert~0=v_~v_assert~0_83, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_32, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_15|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_22|, ~pos~0=v_~pos~0_141, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_22|, ~d1~0=v_~d1~0_68} AuxVars[] AssignedVars[~v_assert~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread3Thread1of1ForFork2_#res.offset, ~pos~0, thread3Thread1of1ForFork2_#res.base] [2022-12-06 07:29:19,091 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:29:19,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 07:29:19,092 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 142 flow [2022-12-06 07:29:19,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-06 07:29:19,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:29:19,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -856919952, now seen corresponding path program 1 times [2022-12-06 07:29:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926897268] [2022-12-06 07:29:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926897268] [2022-12-06 07:29:19,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926897268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883570451] [2022-12-06 07:29:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:29:19,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:29:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,319 INFO L130 PetriNetUnfolder]: 225/410 cut-off events. [2022-12-06 07:29:19,320 INFO L131 PetriNetUnfolder]: For 539/539 co-relation queries the response was YES. [2022-12-06 07:29:19,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 410 events. 225/410 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1504 event pairs, 41 based on Foata normal form. 20/430 useless extension candidates. Maximal degree in co-relation 728. Up to 261 conditions per place. [2022-12-06 07:29:19,321 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 36 selfloop transitions, 8 changer transitions 3/47 dead transitions. [2022-12-06 07:29:19,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 333 flow [2022-12-06 07:29:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:29:19,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 07:29:19,322 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 142 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:29:19,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 333 flow [2022-12-06 07:29:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 315 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:29:19,324 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:19,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 07:29:19,325 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 07:29:19,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,325 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:19,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:19,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:19,332 INFO L130 PetriNetUnfolder]: 25/92 cut-off events. [2022-12-06 07:29:19,332 INFO L131 PetriNetUnfolder]: For 121/127 co-relation queries the response was YES. [2022-12-06 07:29:19,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 92 events. 25/92 cut-off events. For 121/127 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 312 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 196. Up to 33 conditions per place. [2022-12-06 07:29:19,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-06 07:29:19,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 07:29:19,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] and [342] $Ultimate##0-->thread3EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_39 v_~v_assert~0_92) (= |v_thread3Thread1of1ForFork2_#res.base_27| 0) (= |v_thread3Thread1of1ForFork2_#res.offset_27| 0) (= (ite (= (ite (<= 0 v_~pos~0_148) 1 0) 0) 0 1) v_~v_assert~0_91)) InVars {~v_assert~0=v_~v_assert~0_92, ~pos~0=v_~pos~0_148} OutVars{~v_assert~0=v_~v_assert~0_91, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_39, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_27|, ~pos~0=v_~pos~0_148} AuxVars[] AssignedVars[~v_assert~0, thread1Thread1of1ForFork0_~lv_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-06 07:29:19,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] and [343] $Ultimate##0-->L54: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_41 v_~v_assert~0_96) (= |v_thread3Thread1of1ForFork2_#res.base_29| 0) (= (ite (= (ite (<= 0 v_~pos~0_151) 1 0) 0) 0 1) v_~v_assert~0_95) (= |v_thread3Thread1of1ForFork2_#res.offset_29| 0) (let ((.cse0 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_41 256) 0))) (.cse1 (= (mod v_~d1~0_76 256) 0))) (or (and .cse0 (= v_~pos~0_151 (+ v_~pos~0_150 1)) .cse1 (= |v_thread1Thread1of1ForFork0_#t~post1_24| |v_thread1Thread1of1ForFork0_#t~post1_23|)) (and .cse0 (not .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_19| |v_thread1Thread1of1ForFork0_#t~post2_20|) (= v_~pos~0_150 (+ v_~pos~0_151 1)))))) InVars {~v_assert~0=v_~v_assert~0_96, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_24|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_20|, ~pos~0=v_~pos~0_151, ~d1~0=v_~d1~0_76} OutVars{~v_assert~0=v_~v_assert~0_95, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_41, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_29|, ~pos~0=v_~pos~0_150, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_29|, ~d1~0=v_~d1~0_76} AuxVars[] AssignedVars[~v_assert~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~lv_assert~0, thread1Thread1of1ForFork0_#t~post2, thread3Thread1of1ForFork2_#res.offset, ~pos~0, thread3Thread1of1ForFork2_#res.base] [2022-12-06 07:29:19,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] and [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-06 07:29:19,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 07:29:19,466 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 188 flow [2022-12-06 07:29:19,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:19,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:29:19,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -287555900, now seen corresponding path program 1 times [2022-12-06 07:29:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791560664] [2022-12-06 07:29:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,535 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-06 07:29:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791560664] [2022-12-06 07:29:19,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791560664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:29:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902111342] [2022-12-06 07:29:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:29:19,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 07:29:19,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:29:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,615 INFO L130 PetriNetUnfolder]: 219/378 cut-off events. [2022-12-06 07:29:19,616 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-06 07:29:19,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 378 events. 219/378 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1302 event pairs, 23 based on Foata normal form. 12/388 useless extension candidates. Maximal degree in co-relation 707. Up to 152 conditions per place. [2022-12-06 07:29:19,618 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 41 selfloop transitions, 10 changer transitions 1/52 dead transitions. [2022-12-06 07:29:19,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 390 flow [2022-12-06 07:29:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:29:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:29:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:29:19,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.384 [2022-12-06 07:29:19,619 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 188 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:29:19,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 390 flow [2022-12-06 07:29:19,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 365 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 07:29:19,623 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:19,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 07:29:19,624 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 07:29:19,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,624 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:19,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 202 flow [2022-12-06 07:29:19,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 202 flow [2022-12-06 07:29:19,633 INFO L130 PetriNetUnfolder]: 33/96 cut-off events. [2022-12-06 07:29:19,633 INFO L131 PetriNetUnfolder]: For 296/305 co-relation queries the response was YES. [2022-12-06 07:29:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 96 events. 33/96 cut-off events. For 296/305 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 296 event pairs, 1 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 264. Up to 41 conditions per place. [2022-12-06 07:29:19,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 202 flow [2022-12-06 07:29:19,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 07:29:19,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-06 07:29:19,905 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 204 flow [2022-12-06 07:29:19,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 07:29:19,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:29:19,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 621354104, now seen corresponding path program 1 times [2022-12-06 07:29:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675114980] [2022-12-06 07:29:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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-06 07:29:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675114980] [2022-12-06 07:29:20,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675114980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266365758] [2022-12-06 07:29:20,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:20,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:20,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:29:20,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:29:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,150 INFO L130 PetriNetUnfolder]: 193/314 cut-off events. [2022-12-06 07:29:20,150 INFO L131 PetriNetUnfolder]: For 975/975 co-relation queries the response was YES. [2022-12-06 07:29:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 314 events. 193/314 cut-off events. For 975/975 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 914 event pairs, 25 based on Foata normal form. 10/324 useless extension candidates. Maximal degree in co-relation 959. Up to 246 conditions per place. [2022-12-06 07:29:20,152 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 34 selfloop transitions, 3 changer transitions 12/49 dead transitions. [2022-12-06 07:29:20,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 378 flow [2022-12-06 07:29:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:29:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:29:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 07:29:20,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2948717948717949 [2022-12-06 07:29:20,154 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 204 flow. Second operand 6 states and 46 transitions. [2022-12-06 07:29:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 378 flow [2022-12-06 07:29:20,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 362 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:29:20,156 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 166 flow [2022-12-06 07:29:20,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-06 07:29:20,156 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 07:29:20,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,156 INFO L89 Accepts]: Start accepts. Operand has 50 places, 30 transitions, 166 flow [2022-12-06 07:29:20,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 30 transitions, 166 flow [2022-12-06 07:29:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 30 transitions, 166 flow [2022-12-06 07:29:20,163 INFO L130 PetriNetUnfolder]: 30/76 cut-off events. [2022-12-06 07:29:20,163 INFO L131 PetriNetUnfolder]: For 179/187 co-relation queries the response was YES. [2022-12-06 07:29:20,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 76 events. 30/76 cut-off events. For 179/187 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 182 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 231. Up to 36 conditions per place. [2022-12-06 07:29:20,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 30 transitions, 166 flow [2022-12-06 07:29:20,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 07:29:20,164 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:20,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 07:29:20,165 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 166 flow [2022-12-06 07:29:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:29:20,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -686540910, now seen corresponding path program 1 times [2022-12-06 07:29:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742543610] [2022-12-06 07:29:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742543610] [2022-12-06 07:29:20,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742543610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:29:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366175840] [2022-12-06 07:29:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:20,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:29:20,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:29:20,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,544 INFO L130 PetriNetUnfolder]: 297/478 cut-off events. [2022-12-06 07:29:20,544 INFO L131 PetriNetUnfolder]: For 1215/1215 co-relation queries the response was YES. [2022-12-06 07:29:20,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 478 events. 297/478 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1599 event pairs, 14 based on Foata normal form. 12/490 useless extension candidates. Maximal degree in co-relation 1828. Up to 179 conditions per place. [2022-12-06 07:29:20,547 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 64 selfloop transitions, 35 changer transitions 0/99 dead transitions. [2022-12-06 07:29:20,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 760 flow [2022-12-06 07:29:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:29:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:29:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-12-06 07:29:20,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2022-12-06 07:29:20,549 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 166 flow. Second operand 9 states and 93 transitions. [2022-12-06 07:29:20,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 760 flow [2022-12-06 07:29:20,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 99 transitions, 720 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:20,554 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 513 flow [2022-12-06 07:29:20,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=513, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-06 07:29:20,556 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2022-12-06 07:29:20,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,556 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 513 flow [2022-12-06 07:29:20,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 513 flow [2022-12-06 07:29:20,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 513 flow [2022-12-06 07:29:20,571 INFO L130 PetriNetUnfolder]: 65/146 cut-off events. [2022-12-06 07:29:20,571 INFO L131 PetriNetUnfolder]: For 868/890 co-relation queries the response was YES. [2022-12-06 07:29:20,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 146 events. 65/146 cut-off events. For 868/890 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 453 event pairs, 3 based on Foata normal form. 9/153 useless extension candidates. Maximal degree in co-relation 659. Up to 64 conditions per place. [2022-12-06 07:29:20,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 513 flow [2022-12-06 07:29:20,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 07:29:20,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [295] L54-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_11 v_~v_assert~0_24) (= v_~d1~0_12 (ite (= (ite (= (mod v_~d1~0_13 256) 0) 1 0) 0) 0 1))) InVars {~v_assert~0=v_~v_assert~0_24, ~d1~0=v_~d1~0_13} OutVars{~v_assert~0=v_~v_assert~0_24, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_11, ~d1~0=v_~d1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0, ~d1~0] [2022-12-06 07:29:20,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [337] L83-->L78: Formula: (let ((.cse0 (not (= (mod v_thread2Thread1of1ForFork1_~lv_assert~1_In_3 256) 0))) (.cse1 (= (mod v_~d2~0_In_5 256) 0))) (or (and .cse0 (= (+ v_~pos~0_In_10 2) v_~pos~0_Out_22) (not .cse1)) (and (= (+ v_~pos~0_Out_22 2) v_~pos~0_In_10) .cse0 .cse1))) InVars {thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_In_3, ~pos~0=v_~pos~0_In_10, ~d2~0=v_~d2~0_In_5} OutVars{thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_In_3, ~pos~0=v_~pos~0_Out_22, ~d2~0=v_~d2~0_In_5} AuxVars[] AssignedVars[~pos~0] [2022-12-06 07:29:20,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 07:29:20,707 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 531 flow [2022-12-06 07:29:20,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:29:20,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash 572054576, now seen corresponding path program 2 times [2022-12-06 07:29:20,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897281400] [2022-12-06 07:29:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897281400] [2022-12-06 07:29:20,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897281400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:29:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926104140] [2022-12-06 07:29:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:20,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:29:20,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 531 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:20,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:29:20,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,141 INFO L130 PetriNetUnfolder]: 425/744 cut-off events. [2022-12-06 07:29:21,141 INFO L131 PetriNetUnfolder]: For 4843/4843 co-relation queries the response was YES. [2022-12-06 07:29:21,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4012 conditions, 744 events. 425/744 cut-off events. For 4843/4843 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2987 event pairs, 30 based on Foata normal form. 16/760 useless extension candidates. Maximal degree in co-relation 2995. Up to 285 conditions per place. [2022-12-06 07:29:21,146 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 92 selfloop transitions, 63 changer transitions 0/155 dead transitions. [2022-12-06 07:29:21,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 155 transitions, 1584 flow [2022-12-06 07:29:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:29:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:29:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2022-12-06 07:29:21,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 07:29:21,147 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 531 flow. Second operand 9 states and 111 transitions. [2022-12-06 07:29:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 155 transitions, 1584 flow [2022-12-06 07:29:21,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 155 transitions, 1574 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 07:29:21,157 INFO L231 Difference]: Finished difference. Result has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1273, PETRI_PLACES=71, PETRI_TRANSITIONS=99} [2022-12-06 07:29:21,158 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2022-12-06 07:29:21,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,158 INFO L89 Accepts]: Start accepts. Operand has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,180 INFO L130 PetriNetUnfolder]: 94/258 cut-off events. [2022-12-06 07:29:21,180 INFO L131 PetriNetUnfolder]: For 2440/2476 co-relation queries the response was YES. [2022-12-06 07:29:21,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 258 events. 94/258 cut-off events. For 2440/2476 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 1 based on Foata normal form. 10/265 useless extension candidates. Maximal degree in co-relation 1415. Up to 103 conditions per place. [2022-12-06 07:29:21,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 07:29:21,183 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:21,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 07:29:21,184 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 99 transitions, 1273 flow [2022-12-06 07:29:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:29:21,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1341213391, now seen corresponding path program 1 times [2022-12-06 07:29:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347203445] [2022-12-06 07:29:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347203445] [2022-12-06 07:29:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347203445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:29:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122916025] [2022-12-06 07:29:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:29:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:29:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:29:21,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:29:21,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 99 transitions, 1273 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-06 07:29:21,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:29:21,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,462 INFO L130 PetriNetUnfolder]: 492/839 cut-off events. [2022-12-06 07:29:21,462 INFO L131 PetriNetUnfolder]: For 9230/9230 co-relation queries the response was YES. [2022-12-06 07:29:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 839 events. 492/839 cut-off events. For 9230/9230 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3417 event pairs, 6 based on Foata normal form. 30/869 useless extension candidates. Maximal degree in co-relation 4637. Up to 374 conditions per place. [2022-12-06 07:29:21,468 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 96 selfloop transitions, 43 changer transitions 34/173 dead transitions. [2022-12-06 07:29:21,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 2447 flow [2022-12-06 07:29:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:29:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:29:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-12-06 07:29:21,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3688888888888889 [2022-12-06 07:29:21,469 INFO L175 Difference]: Start difference. First operand has 71 places, 99 transitions, 1273 flow. Second operand 9 states and 83 transitions. [2022-12-06 07:29:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 2447 flow [2022-12-06 07:29:21,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 173 transitions, 2311 flow, removed 68 selfloop flow, removed 0 redundant places. [2022-12-06 07:29:21,501 INFO L231 Difference]: Finished difference. Result has 85 places, 104 transitions, 1459 flow [2022-12-06 07:29:21,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1459, PETRI_PLACES=85, PETRI_TRANSITIONS=104} [2022-12-06 07:29:21,502 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2022-12-06 07:29:21,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,502 INFO L89 Accepts]: Start accepts. Operand has 85 places, 104 transitions, 1459 flow [2022-12-06 07:29:21,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 104 transitions, 1459 flow [2022-12-06 07:29:21,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 104 transitions, 1459 flow [2022-12-06 07:29:21,551 INFO L130 PetriNetUnfolder]: 78/215 cut-off events. [2022-12-06 07:29:21,552 INFO L131 PetriNetUnfolder]: For 2460/2481 co-relation queries the response was YES. [2022-12-06 07:29:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 215 events. 78/215 cut-off events. For 2460/2481 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 895 event pairs, 2 based on Foata normal form. 4/216 useless extension candidates. Maximal degree in co-relation 1294. Up to 80 conditions per place. [2022-12-06 07:29:21,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 104 transitions, 1459 flow [2022-12-06 07:29:21,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 07:29:21,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_7| 0) (= v_~v_assert~0_64 (ite (= (ite (<= 0 v_~pos~0_121) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork2_#res.base_7| 0)) InVars {~pos~0=v_~pos~0_121} OutVars{~v_assert~0=v_~v_assert~0_64, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_7|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_7|, ~pos~0=v_~pos~0_121} AuxVars[] AssignedVars[~v_assert~0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [339] L59-->L54: Formula: (let ((.cse0 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_In_3 256) 0))) (.cse1 (= (mod v_~d1~0_In_6 256) 0))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_6| |v_thread1Thread1of1ForFork0_#t~post1_In_2|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_26 1))) (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_26) (= |v_thread1Thread1of1ForFork0_#t~post2_In_2| |v_thread1Thread1of1ForFork0_#t~post2_Out_6|) (not .cse1)))) InVars {~pos~0=v_~pos~0_In_12, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_2|, ~d1~0=v_~d1~0_In_6} OutVars{~pos~0=v_~pos~0_Out_26, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_6|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_6|, ~d1~0=v_~d1~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0] [2022-12-06 07:29:21,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 07:29:21,641 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 1457 flow [2022-12-06 07:29:21,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-06 07:29:21,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:29:21,641 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash 444345688, now seen corresponding path program 3 times [2022-12-06 07:29:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990641243] [2022-12-06 07:29:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990641243] [2022-12-06 07:29:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990641243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:29:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060387061] [2022-12-06 07:29:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:29:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:29:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:29:21,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:29:21,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 103 transitions, 1457 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:21,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:29:21,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,989 INFO L130 PetriNetUnfolder]: 621/1084 cut-off events. [2022-12-06 07:29:21,989 INFO L131 PetriNetUnfolder]: For 13868/13868 co-relation queries the response was YES. [2022-12-06 07:29:21,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7563 conditions, 1084 events. 621/1084 cut-off events. For 13868/13868 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5011 event pairs, 28 based on Foata normal form. 32/1116 useless extension candidates. Maximal degree in co-relation 5748. Up to 636 conditions per place. [2022-12-06 07:29:22,000 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 112 selfloop transitions, 15 changer transitions 91/218 dead transitions. [2022-12-06 07:29:22,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 218 transitions, 3452 flow [2022-12-06 07:29:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:29:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:29:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-06 07:29:22,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 07:29:22,001 INFO L175 Difference]: Start difference. First operand has 84 places, 103 transitions, 1457 flow. Second operand 8 states and 84 transitions. [2022-12-06 07:29:22,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 218 transitions, 3452 flow [2022-12-06 07:29:22,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 218 transitions, 3248 flow, removed 67 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:22,037 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1607, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2022-12-06 07:29:22,038 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2022-12-06 07:29:22,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,038 INFO L89 Accepts]: Start accepts. Operand has 90 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,061 INFO L130 PetriNetUnfolder]: 85/229 cut-off events. [2022-12-06 07:29:22,061 INFO L131 PetriNetUnfolder]: For 2748/2770 co-relation queries the response was YES. [2022-12-06 07:29:22,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 229 events. 85/229 cut-off events. For 2748/2770 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 960 event pairs, 2 based on Foata normal form. 5/232 useless extension candidates. Maximal degree in co-relation 1439. Up to 81 conditions per place. [2022-12-06 07:29:22,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-06 07:29:22,064 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:22,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 07:29:22,065 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 111 transitions, 1607 flow [2022-12-06 07:29:22,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:22,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:29:22,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1522963506, now seen corresponding path program 1 times [2022-12-06 07:29:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068386426] [2022-12-06 07:29:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068386426] [2022-12-06 07:29:22,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068386426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:22,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996643083] [2022-12-06 07:29:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:22,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:22,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:29:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:29:22,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:22,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:22,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996643083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:22,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:22,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 07:29:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600716682] [2022-12-06 07:29:22,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:29:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:29:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:29:22,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:29:22,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 111 transitions, 1607 flow. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-06 07:29:22,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:29:22,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,054 INFO L130 PetriNetUnfolder]: 862/1475 cut-off events. [2022-12-06 07:29:23,054 INFO L131 PetriNetUnfolder]: For 19182/19182 co-relation queries the response was YES. [2022-12-06 07:29:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 1475 events. 862/1475 cut-off events. For 19182/19182 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7101 event pairs, 15 based on Foata normal form. 52/1527 useless extension candidates. Maximal degree in co-relation 9963. Up to 471 conditions per place. [2022-12-06 07:29:23,069 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 124 selfloop transitions, 60 changer transitions 147/331 dead transitions. [2022-12-06 07:29:23,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 331 transitions, 5164 flow [2022-12-06 07:29:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:29:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:29:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-12-06 07:29:23,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34841628959276016 [2022-12-06 07:29:23,070 INFO L175 Difference]: Start difference. First operand has 86 places, 111 transitions, 1607 flow. Second operand 17 states and 154 transitions. [2022-12-06 07:29:23,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 331 transitions, 5164 flow [2022-12-06 07:29:23,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 331 transitions, 4844 flow, removed 97 selfloop flow, removed 6 redundant places. [2022-12-06 07:29:23,125 INFO L231 Difference]: Finished difference. Result has 103 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1992, PETRI_PLACES=103, PETRI_TRANSITIONS=129} [2022-12-06 07:29:23,126 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 07:29:23,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,126 INFO L89 Accepts]: Start accepts. Operand has 103 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,180 INFO L130 PetriNetUnfolder]: 104/267 cut-off events. [2022-12-06 07:29:23,180 INFO L131 PetriNetUnfolder]: For 4246/4251 co-relation queries the response was YES. [2022-12-06 07:29:23,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 267 events. 104/267 cut-off events. For 4246/4251 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1101 event pairs, 2 based on Foata normal form. 5/272 useless extension candidates. Maximal degree in co-relation 1834. Up to 91 conditions per place. [2022-12-06 07:29:23,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 07:29:23,184 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:23,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 07:29:23,184 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 129 transitions, 1992 flow [2022-12-06 07:29:23,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-06 07:29:23,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,185 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:29:23,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 07:29:23,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,391 INFO L85 PathProgramCache]: Analyzing trace with hash -228117422, now seen corresponding path program 4 times [2022-12-06 07:29:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758624906] [2022-12-06 07:29:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758624906] [2022-12-06 07:29:23,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758624906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:29:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843333601] [2022-12-06 07:29:23,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 07:29:23,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:29:23,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:29:23,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:29:23,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 07:29:23,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:29:23,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:29:23,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:29:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:23,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:24,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843333601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:24,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:24,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-06 07:29:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985728801] [2022-12-06 07:29:24,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:29:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:29:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:29:24,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:29:24,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 129 transitions, 1992 flow. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 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-06 07:29:24,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:29:24,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,628 INFO L130 PetriNetUnfolder]: 1392/2413 cut-off events. [2022-12-06 07:29:25,628 INFO L131 PetriNetUnfolder]: For 41993/41993 co-relation queries the response was YES. [2022-12-06 07:29:25,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18354 conditions, 2413 events. 1392/2413 cut-off events. For 41993/41993 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12841 event pairs, 9 based on Foata normal form. 74/2487 useless extension candidates. Maximal degree in co-relation 16684. Up to 845 conditions per place. [2022-12-06 07:29:25,657 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 191 selfloop transitions, 175 changer transitions 238/604 dead transitions. [2022-12-06 07:29:25,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 604 transitions, 9408 flow [2022-12-06 07:29:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-06 07:29:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-06 07:29:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 353 transitions. [2022-12-06 07:29:25,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24685314685314685 [2022-12-06 07:29:25,663 INFO L175 Difference]: Start difference. First operand has 97 places, 129 transitions, 1992 flow. Second operand 55 states and 353 transitions. [2022-12-06 07:29:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 604 transitions, 9408 flow [2022-12-06 07:29:25,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 604 transitions, 8552 flow, removed 283 selfloop flow, removed 11 redundant places. [2022-12-06 07:29:25,778 INFO L231 Difference]: Finished difference. Result has 155 places, 248 transitions, 4131 flow [2022-12-06 07:29:25,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4131, PETRI_PLACES=155, PETRI_TRANSITIONS=248} [2022-12-06 07:29:25,778 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2022-12-06 07:29:25,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,778 INFO L89 Accepts]: Start accepts. Operand has 155 places, 248 transitions, 4131 flow [2022-12-06 07:29:25,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 248 transitions, 4131 flow [2022-12-06 07:29:25,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 248 transitions, 4131 flow [2022-12-06 07:29:25,855 INFO L130 PetriNetUnfolder]: 182/483 cut-off events. [2022-12-06 07:29:25,855 INFO L131 PetriNetUnfolder]: For 7931/7935 co-relation queries the response was YES. [2022-12-06 07:29:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 483 events. 182/483 cut-off events. For 7931/7935 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2432 event pairs, 5 based on Foata normal form. 4/487 useless extension candidates. Maximal degree in co-relation 3525. Up to 177 conditions per place. [2022-12-06 07:29:25,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 248 transitions, 4131 flow [2022-12-06 07:29:25,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 1074 [2022-12-06 07:29:25,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L59-->L54: Formula: (let ((.cse0 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_In_3 256) 0))) (.cse1 (= (mod v_~d1~0_In_6 256) 0))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_6| |v_thread1Thread1of1ForFork0_#t~post1_In_2|) (= v_~pos~0_In_12 (+ v_~pos~0_Out_26 1))) (and .cse0 (= (+ v_~pos~0_In_12 1) v_~pos~0_Out_26) (= |v_thread1Thread1of1ForFork0_#t~post2_In_2| |v_thread1Thread1of1ForFork0_#t~post2_Out_6|) (not .cse1)))) InVars {~pos~0=v_~pos~0_In_12, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_2|, ~d1~0=v_~d1~0_In_6} OutVars{~pos~0=v_~pos~0_Out_26, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_6|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_In_3, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_6|, ~d1~0=v_~d1~0_In_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0] and [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] [2022-12-06 07:29:26,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] L54-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_11 v_~v_assert~0_24) (= v_~d1~0_12 (ite (= (ite (= (mod v_~d1~0_13 256) 0) 1 0) 0) 0 1))) InVars {~v_assert~0=v_~v_assert~0_24, ~d1~0=v_~d1~0_13} OutVars{~v_assert~0=v_~v_assert~0_24, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_11, ~d1~0=v_~d1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0, ~d1~0] and [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] [2022-12-06 07:29:26,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] L54-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_11 v_~v_assert~0_24) (= v_~d1~0_12 (ite (= (ite (= (mod v_~d1~0_13 256) 0) 1 0) 0) 0 1))) InVars {~v_assert~0=v_~v_assert~0_24, ~d1~0=v_~d1~0_13} OutVars{~v_assert~0=v_~v_assert~0_24, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_11, ~d1~0=v_~d1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0, ~d1~0] and [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] [2022-12-06 07:29:26,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [359] L59-->L54: Formula: (let ((.cse1 (+ v_~pos~0_206 1)) (.cse3 (= (mod v_~d1~0_126 256) 0))) (and (let ((.cse0 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_82 256) 0))) (.cse2 (= (mod v_~d1~0_125 256) 0))) (or (and .cse0 (= v_~pos~0_205 .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_62| |v_thread1Thread1of1ForFork0_#t~post2_61|) (not .cse2)) (and .cse0 .cse2 (= v_~pos~0_206 (+ v_~pos~0_205 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_66| |v_thread1Thread1of1ForFork0_#t~post1_65|)))) (= v_~v_assert~0_143 v_thread1Thread1of1ForFork0_~lv_assert~0_82) (let ((.cse4 (not (= (mod v_thread1Thread1of1ForFork0_~lv_assert~0_83 256) 0)))) (or (and (= v_~pos~0_206 (+ v_~pos~0_207 1)) (not .cse3) .cse4 (= |v_thread1Thread1of1ForFork0_#t~post2_63| |v_thread1Thread1of1ForFork0_#t~post2_62|)) (and .cse3 (= |v_thread1Thread1of1ForFork0_#t~post1_67| |v_thread1Thread1of1ForFork0_#t~post1_66|) (= v_~pos~0_207 .cse1) .cse4))) (= v_~d1~0_125 (ite (= (ite .cse3 1 0) 0) 0 1)))) InVars {~v_assert~0=v_~v_assert~0_143, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_67|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_83, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_63|, ~pos~0=v_~pos~0_207, ~d1~0=v_~d1~0_126} OutVars{~v_assert~0=v_~v_assert~0_143, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_65|, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_82, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_61|, ~pos~0=v_~pos~0_205, ~d1~0=v_~d1~0_125} AuxVars[|v_thread1Thread1of1ForFork0_#t~post2_62|, v_~pos~0_206, |v_thread1Thread1of1ForFork0_#t~post1_66|] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~lv_assert~0, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] [2022-12-06 07:29:26,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] L54-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_~lv_assert~0_11 v_~v_assert~0_24) (= v_~d1~0_12 (ite (= (ite (= (mod v_~d1~0_13 256) 0) 1 0) 0) 0 1))) InVars {~v_assert~0=v_~v_assert~0_24, ~d1~0=v_~d1~0_13} OutVars{~v_assert~0=v_~v_assert~0_24, thread1Thread1of1ForFork0_~lv_assert~0=v_thread1Thread1of1ForFork0_~lv_assert~0_11, ~d1~0=v_~d1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~lv_assert~0, ~d1~0] and [244] $Ultimate##0-->L83: Formula: (= v_~v_assert~0_4 v_thread2Thread1of1ForFork1_~lv_assert~1_1) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork1_~lv_assert~1=v_thread2Thread1of1ForFork1_~lv_assert~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~lv_assert~1] [2022-12-06 07:29:26,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:29:27,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 07:29:27,136 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post1_69 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:29:27,138 INFO L158 Benchmark]: Toolchain (without parser) took 12513.12ms. Allocated memory was 242.2MB in the beginning and 477.1MB in the end (delta: 234.9MB). Free memory was 217.8MB in the beginning and 343.0MB in the end (delta: -125.2MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,138 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 242.2MB. Free memory was 219.3MB in the beginning and 219.2MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:29:27,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.77ms. Allocated memory is still 242.2MB. Free memory was 217.8MB in the beginning and 204.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.70ms. Allocated memory is still 242.2MB. Free memory was 204.2MB in the beginning and 202.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,139 INFO L158 Benchmark]: Boogie Preprocessor took 26.78ms. Allocated memory is still 242.2MB. Free memory was 202.6MB in the beginning and 201.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,139 INFO L158 Benchmark]: RCFGBuilder took 411.80ms. Allocated memory is still 242.2MB. Free memory was 201.6MB in the beginning and 186.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,139 INFO L158 Benchmark]: TraceAbstraction took 11813.31ms. Allocated memory was 242.2MB in the beginning and 477.1MB in the end (delta: 234.9MB). Free memory was 186.4MB in the beginning and 343.0MB in the end (delta: -156.7MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2022-12-06 07:29:27,140 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 242.2MB. Free memory was 219.3MB in the beginning and 219.2MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.77ms. Allocated memory is still 242.2MB. Free memory was 217.8MB in the beginning and 204.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.70ms. Allocated memory is still 242.2MB. Free memory was 204.2MB in the beginning and 202.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.78ms. Allocated memory is still 242.2MB. Free memory was 202.6MB in the beginning and 201.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 411.80ms. Allocated memory is still 242.2MB. Free memory was 201.6MB in the beginning and 186.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11813.31ms. Allocated memory was 242.2MB in the beginning and 477.1MB in the end (delta: 234.9MB). Free memory was 186.4MB in the beginning and 343.0MB in the end (delta: -156.7MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 89 PlacesBefore, 30 PlacesAfterwards, 86 TransitionsBefore, 22 TransitionsAfterwards, 1134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 26 ConcurrentYvCompositions, 5 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 643, independent: 630, independent conditional: 630, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 643, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 643, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 643, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 572, independent: 561, independent conditional: 0, independent unconditional: 561, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 572, independent: 559, independent conditional: 0, independent unconditional: 559, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 643, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 572, unknown conditional: 0, unknown unconditional: 572] , Statistics on independence cache: Total cache size (in pairs): 931, Positive cache size: 920, Positive conditional cache size: 0, Positive unconditional cache size: 920, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 3, Positive conditional cache size: 1, Positive unconditional cache size: 2, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, 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.2s, 35 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 30 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 34, independent conditional: 22, independent unconditional: 12, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 21, independent conditional: 11, independent unconditional: 10, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 12, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 18, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 42, independent conditional: 18, independent unconditional: 24, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 42, independent conditional: 18, independent unconditional: 24, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 35, independent conditional: 12, independent unconditional: 23, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 18, Positive unconditional cache size: 5, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 27, Positive conditional cache size: 20, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 144 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): 31, Positive cache size: 27, Positive conditional cache size: 20, Positive unconditional cache size: 7, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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, 55 PlacesBefore, 55 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 378 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): 32, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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, 85 PlacesBefore, 84 PlacesAfterwards, 104 TransitionsBefore, 103 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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, 86 PlacesBefore, 86 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 420 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): 32, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, 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.0s, 97 PlacesBefore, 97 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 530 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): 32, Positive cache size: 28, Positive conditional cache size: 20, Positive unconditional cache size: 8, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post1_69 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post1_69 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:29:27,161 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...