/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:04:27,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:04:27,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:04:27,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:04:27,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:04:27,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:04:27,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:04:27,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:04:27,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:04:27,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:04:27,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:04:27,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:04:27,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:04:27,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:04:27,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:04:27,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:04:27,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:04:27,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:04:27,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:04:27,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:04:27,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:04:27,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:04:27,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:04:27,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:04:27,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:04:27,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:04:27,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:04:27,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:04:27,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:04:27,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:04:27,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:04:27,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:04:27,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:04:27,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:04:27,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:04:27,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:04:27,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:04:27,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:04:27,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:04:27,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:04:27,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:04:27,207 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:04:27,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:04:27,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:04:27,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:04:27,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:04:27,238 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:04:27,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:04:27,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:04:27,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:04:27,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:04:27,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:04:27,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:04:27,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:04:27,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:04:27,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:04:27,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:04:27,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:27,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:04:27,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:04:27,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:04:27,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:04:27,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:04:27,241 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 05:04:27,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:04:27,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:04:27,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:04:27,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:04:27,521 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:04:27,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2022-12-06 05:04:28,383 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:04:28,559 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:04:28,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2022-12-06 05:04:28,564 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736472753/3147d7088f2e426a8672e12780408299/FLAGdf3b0cc7d [2022-12-06 05:04:28,575 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736472753/3147d7088f2e426a8672e12780408299 [2022-12-06 05:04:28,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:04:28,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:04:28,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:28,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:04:28,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:04:28,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f342c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28, skipping insertion in model container [2022-12-06 05:04:28,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:04:28,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:04:28,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,737 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/chl-collitem-subst.wvr.c[3544,3557] [2022-12-06 05:04:28,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:28,756 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:04:28,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:04:28,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:04:28,789 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/chl-collitem-subst.wvr.c[3544,3557] [2022-12-06 05:04:28,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:04:28,806 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:04:28,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28 WrapperNode [2022-12-06 05:04:28,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:04:28,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:28,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:04:28,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:04:28,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,862 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 353 [2022-12-06 05:04:28,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:04:28,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:04:28,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:04:28,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:04:28,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:04:28,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:04:28,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:04:28,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:04:28,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (1/1) ... [2022-12-06 05:04:28,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:04:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:04:28,932 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 05:04:28,963 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 05:04:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:04:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:04:28,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:04:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:04:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:04:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:04:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:04:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:04:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:04:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:04:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:04:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:04:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:04:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:04:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:04:28,983 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 05:04:29,122 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:04:29,123 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:04:29,627 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:04:30,036 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:04:30,036 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:04:30,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:30 BoogieIcfgContainer [2022-12-06 05:04:30,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:04:30,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:04:30,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:04:30,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:04:30,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:04:28" (1/3) ... [2022-12-06 05:04:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbd6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:30, skipping insertion in model container [2022-12-06 05:04:30,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:04:28" (2/3) ... [2022-12-06 05:04:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbd6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:04:30, skipping insertion in model container [2022-12-06 05:04:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:04:30" (3/3) ... [2022-12-06 05:04:30,045 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2022-12-06 05:04:30,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:04:30,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:04:30,060 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:04:30,130 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:04:30,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 276 flow [2022-12-06 05:04:30,211 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-06 05:04:30,211 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 22 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2022-12-06 05:04:30,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 276 flow [2022-12-06 05:04:30,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 244 flow [2022-12-06 05:04:30,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:30,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 244 flow [2022-12-06 05:04:30,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 244 flow [2022-12-06 05:04:30,271 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-06 05:04:30,271 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:30,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2022-12-06 05:04:30,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 244 flow [2022-12-06 05:04:30,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 05:04:39,612 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 05:04:39,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:04:39,627 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;@7c8f72f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:04:39,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:04:39,632 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 05:04:39,633 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:04:39,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:39,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:39,633 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 05:04:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 124578236, now seen corresponding path program 1 times [2022-12-06 05:04:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005254494] [2022-12-06 05:04:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:01,891 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 05:05:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:01,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005254494] [2022-12-06 05:05:01,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005254494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:01,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:01,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:05:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121887760] [2022-12-06 05:05:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:05:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:05:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:05:01,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:05:01,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:01,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:01,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:05:01,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:02,304 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-06 05:05:02,304 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 05:05:02,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 277 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-06 05:05:02,306 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-06 05:05:02,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-06 05:05:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:05:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:05:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 05:05:02,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 05:05:02,327 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-06 05:05:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-06 05:05:02,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:02,332 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-06 05:05:02,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 05:05:02,337 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 05:05:02,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:02,338 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-06 05:05:02,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:02,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:02,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-06 05:05:02,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-06 05:05:02,363 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-06 05:05:02,363 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:05:02,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-06 05:05:02,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-06 05:05:02,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 05:05:02,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1086] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (<= v_~cardSet_4~0_37 (+ 2147483647 v_~cardSet_8~0_37)))) (and .cse0 (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (<= v_~cardSet_8~0_37 (+ v_~cardSet_4~0_37 2147483648)) (let ((.cse1 (= |v_thread3_#t~ite17#1_33| 0))) (or (and (<= |v_thread3_#t~ret18#1_47| 2147483647) (= |v_thread3_#t~ret18#1_47| |v_thread3_#t~ite19#1_45|) (= |v_thread3_assume_abort_if_not_#in~cond#1_146| (ite (or (<= 0 |v_thread3_minus_~b#1_182|) (<= |v_thread3_minus_~a#1_181| (+ 2147483647 |v_thread3_minus_~b#1_182|))) 1 0)) (= |v_thread3_minus_~a#1_181| |v_thread3_minus_#in~a#1_113|) (= |v_thread3_#t~ret18#1_47| |v_thread3_minus_#res#1_138|) .cse1 (= |v_thread3_minus_~b#1_182| |v_thread3_minus_#in~b#1_114|) (= v_~cardId_10~0_49 |v_thread3_minus_#in~b#1_114|) (<= 0 (+ |v_thread3_#t~ret18#1_47| 2147483648)) (= (+ |v_thread3_minus_~b#1_182| |v_thread3_minus_#res#1_138|) |v_thread3_minus_~a#1_181|) (= |v_thread3_minus_#in~a#1_113| v_~cardId_6~0_63) (= |v_thread3_assume_abort_if_not_~cond#1_202| |v_thread3_assume_abort_if_not_#in~cond#1_146|)) (and (= |v_thread3_assume_abort_if_not_#in~cond#1_146| |v_thread3_assume_abort_if_not_#in~cond#1_145|) (= |v_thread3_minus_~a#1_182| |v_thread3_minus_~a#1_181|) (= |v_thread3_minus_#in~a#1_114| |v_thread3_minus_#in~a#1_113|) (not .cse1) (= |v_thread3_minus_#res#1_137| |v_thread3_minus_#res#1_138|) (= |v_thread3_assume_abort_if_not_~cond#1_202| |v_thread3_assume_abort_if_not_~cond#1_201|) (= |v_thread3_#t~ite17#1_33| |v_thread3_#t~ite19#1_45|) (= |v_thread3_#t~ret18#1_47| |v_thread3Thread1of1ForFork1_#t~ret18#1_10|) (= |v_thread3_minus_#in~b#1_114| |v_thread3_minus_#in~b#1_113|) (= |v_thread3_minus_~b#1_182| |v_thread3_minus_~b#1_181|)))) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (let ((.cse2 (= |v_thread3_#t~ite19#1_45| 0))) (or (and (= |v_thread3_#t~ite19#1_45| v_~result_14~0_102) (= |v_thread3_#t~ret20#1_51| |v_thread3Thread1of1ForFork1_#t~ret20#1_10|) (= |v_thread3Thread1of1ForFork1_minus_~b#1_7| |v_thread3_minus_~b#1_182|) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| |v_thread3_minus_~a#1_181|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3_assume_abort_if_not_#in~cond#1_146|) (= |v_thread3_assume_abort_if_not_~cond#1_202| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread3Thread1of1ForFork1_minus_#res#1_7| |v_thread3_minus_#res#1_138|) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_7| |v_thread3_minus_#in~b#1_114|) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_7| |v_thread3_minus_#in~a#1_113|) (not .cse2)) (and (= |v_thread3_#t~ret20#1_51| v_~result_14~0_102) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_7| v_~cardType_7~0_63) (= v_~cardType_11~0_57 |v_thread3Thread1of1ForFork1_minus_#in~b#1_7|) (<= 0 (+ |v_thread3_#t~ret20#1_51| 2147483648)) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| |v_thread3Thread1of1ForFork1_minus_#in~a#1_7|) .cse2 (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (or (<= |v_thread3Thread1of1ForFork1_minus_~a#1_7| (+ |v_thread3Thread1of1ForFork1_minus_~b#1_7| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork1_minus_~b#1_7|)) 1 0)) (= |v_thread3Thread1of1ForFork1_minus_~a#1_7| (+ |v_thread3Thread1of1ForFork1_minus_~b#1_7| |v_thread3Thread1of1ForFork1_minus_#res#1_7|)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread3Thread1of1ForFork1_minus_~b#1_7| |v_thread3Thread1of1ForFork1_minus_#in~b#1_7|) (= |v_thread3_#t~ret20#1_51| |v_thread3Thread1of1ForFork1_minus_#res#1_7|) (<= |v_thread3_#t~ret20#1_51| 2147483647)))) (let ((.cse3 (= v_~cardSet_4~0_37 v_~cardSet_8~0_37))) (or (and (= v_~cardRarity_9~0_65 |v_thread3_minus_#in~b#1_113|) (<= |v_thread3_#t~ret16#1_35| 2147483647) (<= 0 (+ |v_thread3_#t~ret16#1_35| 2147483648)) .cse3 (= |v_thread3_minus_~a#1_182| |v_thread3_minus_#in~a#1_114|) (= |v_thread3_assume_abort_if_not_~cond#1_201| |v_thread3_assume_abort_if_not_#in~cond#1_145|) (= |v_thread3_#t~ret16#1_35| |v_thread3_minus_#res#1_137|) (= |v_thread3_assume_abort_if_not_#in~cond#1_145| (ite (or (<= |v_thread3_minus_~a#1_182| (+ 2147483647 |v_thread3_minus_~b#1_181|)) (<= 0 |v_thread3_minus_~b#1_181|)) 1 0)) (= |v_thread3_#t~ret16#1_35| |v_thread3_#t~ite17#1_33|) (= |v_thread3_minus_~a#1_182| (+ |v_thread3_minus_~b#1_181| |v_thread3_minus_#res#1_137|)) (= |v_thread3_minus_~b#1_181| |v_thread3_minus_#in~b#1_113|) (= v_~cardRarity_5~0_57 |v_thread3_minus_#in~a#1_114|)) (let ((.cse4 (ite (or .cse0 (<= 0 v_~cardSet_8~0_37)) 1 0))) (and (= v_~cardSet_4~0_37 (+ |v_thread3_#t~ite17#1_33| v_~cardSet_8~0_37)) (= |v_thread3_assume_abort_if_not_#in~cond#1_145| .cse4) (not .cse3) (= |v_thread3_assume_abort_if_not_~cond#1_201| .cse4) (= |v_thread3_minus_~b#1_181| v_~cardSet_8~0_37) (= |v_thread3_#t~ret16#1_35| |v_thread3Thread1of1ForFork1_#t~ret16#1_10|) (= |v_thread3_minus_#in~a#1_114| v_~cardSet_4~0_37) (= |v_thread3_minus_~a#1_182| v_~cardSet_4~0_37) (= v_~cardSet_8~0_37 |v_thread3_minus_#in~b#1_113|) (= (+ v_~cardSet_8~0_37 |v_thread3_minus_#res#1_137|) v_~cardSet_4~0_37))))))) InVars {thread3Thread1of1ForFork1_#t~ret18#1=|v_thread3Thread1of1ForFork1_#t~ret18#1_10|, ~cardSet_4~0=v_~cardSet_4~0_37, ~cardType_11~0=v_~cardType_11~0_57, ~cardSet_8~0=v_~cardSet_8~0_37, ~cardRarity_9~0=v_~cardRarity_9~0_65, thread3Thread1of1ForFork1_#t~ret20#1=|v_thread3Thread1of1ForFork1_#t~ret20#1_10|, ~cardType_7~0=v_~cardType_7~0_63, ~cardRarity_5~0=v_~cardRarity_5~0_57, ~cardId_10~0=v_~cardId_10~0_49, ~cardId_6~0=v_~cardId_6~0_63, thread3Thread1of1ForFork1_#t~ret16#1=|v_thread3Thread1of1ForFork1_#t~ret16#1_10|} OutVars{~cardId_10~0=v_~cardId_10~0_49, thread3Thread1of1ForFork1_minus_~a#1=|v_thread3Thread1of1ForFork1_minus_~a#1_7|, ~cardId_6~0=v_~cardId_6~0_63, ~cardType_11~0=v_~cardType_11~0_57, thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_7|, ~cardType_7~0=v_~cardType_7~0_63, ~cardRarity_5~0=v_~cardRarity_5~0_57, thread3Thread1of1ForFork1_minus_~b#1=|v_thread3Thread1of1ForFork1_minus_~b#1_7|, thread3Thread1of1ForFork1_#t~ite17#1=|v_thread3Thread1of1ForFork1_#t~ite17#1_7|, thread3Thread1of1ForFork1_#t~ite19#1=|v_thread3Thread1of1ForFork1_#t~ite19#1_7|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~cardSet_4~0=v_~cardSet_4~0_37, ~cardSet_8~0=v_~cardSet_8~0_37, ~cardRarity_9~0=v_~cardRarity_9~0_65, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread3Thread1of1ForFork1_minus_#in~b#1=|v_thread3Thread1of1ForFork1_minus_#in~b#1_7|, thread3Thread1of1ForFork1_minus_#res#1=|v_thread3Thread1of1ForFork1_minus_#res#1_7|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_7|, ~result_14~0=v_~result_14~0_102, thread3Thread1of1ForFork1_minus_#in~a#1=|v_thread3Thread1of1ForFork1_minus_#in~a#1_7|} AuxVars[|v_thread3_assume_abort_if_not_#in~cond#1_146|, |v_thread3_assume_abort_if_not_#in~cond#1_145|, |v_thread3_assume_abort_if_not_~cond#1_202|, |v_thread3_minus_#in~a#1_114|, |v_thread3_minus_#res#1_137|, |v_thread3_#t~ite17#1_33|, |v_thread3_assume_abort_if_not_~cond#1_201|, |v_thread3_minus_~a#1_182|, |v_thread3_#t~ite19#1_45|, |v_thread3_#t~ret16#1_35|, |v_thread3_minus_~a#1_181|, |v_thread3_minus_~b#1_181|, |v_thread3_minus_#res#1_138|, |v_thread3_minus_#in~a#1_113|, |v_thread3_#t~ret18#1_47|, |v_thread3_#t~ret20#1_51|, |v_thread3_minus_~b#1_182|, |v_thread3_minus_#in~b#1_114|, |v_thread3_minus_#in~b#1_113|] AssignedVars[thread3Thread1of1ForFork1_#t~ite19#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~ret18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_minus_~a#1, thread3Thread1of1ForFork1_#t~ret16#1, thread3Thread1of1ForFork1_minus_#in~b#1, thread3Thread1of1ForFork1_minus_#res#1, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~ite21#1, thread3Thread1of1ForFork1_#t~ret20#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_minus_~b#1, ~result_14~0, thread3Thread1of1ForFork1_minus_#in~a#1, thread3Thread1of1ForFork1_#t~ite17#1] and [1041] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (<= v_~cardSet_0~0_31 (+ 2147483647 v_~cardSet_4~0_29)))) (and (let ((.cse0 (= |v_thread1_#t~ite3#1_47| 0))) (or (and (= |v_thread1_minus_#res#1_153| |v_thread1_#t~ret4#1_65|) (= v_~cardId_2~0_55 |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_#in~b#1_131| v_~cardId_6~0_49) (<= 0 (+ |v_thread1_#t~ret4#1_65| 2147483648)) (<= |v_thread1_#t~ret4#1_65| 2147483647) (= (ite (or (<= |v_thread1_minus_~a#1_204| (+ 2147483647 |v_thread1_minus_~b#1_203|)) (<= 0 |v_thread1_minus_~b#1_203|)) 1 0) |v_thread1_assume_abort_if_not_#in~cond#1_169|) (= |v_thread1_#t~ite5#1_61| |v_thread1_#t~ret4#1_65|) (= |v_thread1_assume_abort_if_not_~cond#1_217| |v_thread1_assume_abort_if_not_#in~cond#1_169|) .cse0 (= |v_thread1_minus_~a#1_204| (+ |v_thread1_minus_#res#1_153| |v_thread1_minus_~b#1_203|)) (= |v_thread1_minus_~a#1_204| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_#in~b#1_131| |v_thread1_minus_~b#1_203|)) (and (= |v_thread1_minus_~b#1_204| |v_thread1_minus_~b#1_203|) (= |v_thread1_#t~ret4#1_65| |v_thread1Thread1of1ForFork2_#t~ret4#1_10|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ite5#1_61|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_#in~b#1_131|) (= |v_thread1_assume_abort_if_not_~cond#1_218| |v_thread1_assume_abort_if_not_~cond#1_217|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (not .cse0) (= |v_thread1_minus_#res#1_154| |v_thread1_minus_#res#1_153|) (= |v_thread1_minus_#in~a#1_132| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_~a#1_204| |v_thread1_minus_~a#1_203|)))) (<= v_~cardSet_4~0_29 (+ v_~cardSet_0~0_31 2147483648)) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (let ((.cse1 (= |v_thread1_#t~ite5#1_61| 0))) (or (and (= |v_thread1_minus_#res#1_153| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_#t~ret6#1_10|) (= |v_thread1_assume_abort_if_not_~cond#1_217| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (not .cse1) (= v_~result_12~0_84 |v_thread1_#t~ite5#1_61|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (= |v_thread1_minus_~b#1_203| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1_minus_#in~b#1_131| |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|) (= |v_thread1_minus_~a#1_204| |v_thread1Thread1of1ForFork2_minus_~a#1_7|)) (and (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread1Thread1of1ForFork2_minus_#res#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_7~0_53 |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_3~0_51 |v_thread1Thread1of1ForFork2_minus_#in~a#1_7|) (= v_~result_12~0_84 |v_thread1_#t~ret6#1_71|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_7| (+ 2147483647 |v_thread1Thread1of1ForFork2_minus_~b#1_7|)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_7|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread1_#t~ret6#1_71| 2147483647) .cse1 (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (<= 0 (+ |v_thread1_#t~ret6#1_71| 2147483648))))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0) (let ((.cse2 (= v_~cardSet_0~0_31 v_~cardSet_4~0_29))) (or (let ((.cse3 (ite (or (<= 0 v_~cardSet_4~0_29) .cse4) 1 0))) (and (= (+ |v_thread1_minus_#res#1_154| v_~cardSet_4~0_29) v_~cardSet_0~0_31) (= v_~cardSet_0~0_31 (+ |v_thread1_#t~ite3#1_47| v_~cardSet_4~0_29)) (= v_~cardSet_4~0_29 |v_thread1_minus_~b#1_204|) (not .cse2) (= |v_thread1_minus_~a#1_203| v_~cardSet_0~0_31) (= |v_thread1_minus_#in~b#1_132| v_~cardSet_4~0_29) (= |v_thread1_assume_abort_if_not_~cond#1_218| .cse3) (= |v_thread1_#t~ret2#1_51| |v_thread1Thread1of1ForFork2_#t~ret2#1_10|) (= v_~cardSet_0~0_31 |v_thread1_minus_#in~a#1_132|) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| .cse3))) (and (= |v_thread1_minus_#res#1_154| |v_thread1_#t~ret2#1_51|) (<= |v_thread1_#t~ret2#1_51| 2147483647) (= |v_thread1_minus_~a#1_203| |v_thread1_minus_#in~a#1_132|) .cse2 (= (+ |v_thread1_minus_#res#1_154| |v_thread1_minus_~b#1_204|) |v_thread1_minus_~a#1_203|) (<= 0 (+ |v_thread1_#t~ret2#1_51| 2147483648)) (= |v_thread1_assume_abort_if_not_~cond#1_218| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_minus_#in~b#1_132| v_~cardRarity_5~0_45) (= (ite (or (<= |v_thread1_minus_~a#1_203| (+ 2147483647 |v_thread1_minus_~b#1_204|)) (<= 0 |v_thread1_minus_~b#1_204|)) 1 0) |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= v_~cardRarity_1~0_51 |v_thread1_minus_#in~a#1_132|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ret2#1_51|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_~b#1_204|)))) .cse4)) InVars {thread1Thread1of1ForFork2_#t~ret6#1=|v_thread1Thread1of1ForFork2_#t~ret6#1_10|, ~cardId_2~0=v_~cardId_2~0_55, ~cardRarity_1~0=v_~cardRarity_1~0_51, ~cardSet_4~0=v_~cardSet_4~0_29, ~cardType_3~0=v_~cardType_3~0_51, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_10|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_10|, ~cardType_7~0=v_~cardType_7~0_53, ~cardRarity_5~0=v_~cardRarity_5~0_45, ~cardSet_0~0=v_~cardSet_0~0_31, ~cardId_6~0=v_~cardId_6~0_49} OutVars{thread1Thread1of1ForFork2_#t~ite7#1=|v_thread1Thread1of1ForFork2_#t~ite7#1_7|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_7|, ~cardType_3~0=v_~cardType_3~0_51, ~cardId_6~0=v_~cardId_6~0_49, ~cardId_2~0=v_~cardId_2~0_55, ~cardRarity_1~0=v_~cardRarity_1~0_51, ~cardType_7~0=v_~cardType_7~0_53, ~cardRarity_5~0=v_~cardRarity_5~0_45, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~cardSet_4~0=v_~cardSet_4~0_29, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_7|, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_7|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_7|, ~cardSet_0~0=v_~cardSet_0~0_31, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_7|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_7|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_7|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_7|, ~result_12~0=v_~result_12~0_84} AuxVars[|v_thread1_minus_#in~a#1_131|, |v_thread1_minus_#res#1_154|, |v_thread1_minus_#in~a#1_132|, |v_thread1_minus_~a#1_204|, |v_thread1_minus_#res#1_153|, |v_thread1_minus_#in~b#1_131|, |v_thread1_#t~ite3#1_47|, |v_thread1_minus_#in~b#1_132|, |v_thread1_assume_abort_if_not_#in~cond#1_169|, |v_thread1_minus_~a#1_203|, |v_thread1_minus_~b#1_203|, |v_thread1_#t~ret4#1_65|, |v_thread1_minus_~b#1_204|, |v_thread1_assume_abort_if_not_~cond#1_218|, |v_thread1_assume_abort_if_not_~cond#1_217|, |v_thread1_#t~ret2#1_51|, |v_thread1_#t~ite5#1_61|, |v_thread1_assume_abort_if_not_#in~cond#1_170|, |v_thread1_#t~ret6#1_71|] AssignedVars[thread1Thread1of1ForFork2_#t~ite7#1, thread1Thread1of1ForFork2_#t~ret6#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_minus_~a#1, ~result_12~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 05:05:04,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:05:04,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2072 [2022-12-06 05:05:04,409 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-06 05:05:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:04,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:04,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:05:04,411 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 05:05:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1052122724, now seen corresponding path program 2 times [2022-12-06 05:05:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570918686] [2022-12-06 05:05:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:05,913 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 05:05:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:05,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570918686] [2022-12-06 05:05:05,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570918686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:05,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:05,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:05:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107778381] [2022-12-06 05:05:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:05,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:05:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:05,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:05:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:05:05,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:05:05,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:05,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:05,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:05:05,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:06,185 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-06 05:05:06,185 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 05:05:06,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 438 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-06 05:05:06,186 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 10/47 dead transitions. [2022-12-06 05:05:06,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 244 flow [2022-12-06 05:05:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:05:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:05:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 05:05:06,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 05:05:06,187 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 47 transitions. [2022-12-06 05:05:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 244 flow [2022-12-06 05:05:06,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 240 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:05:06,189 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 110 flow [2022-12-06 05:05:06,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 05:05:06,190 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:05:06,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:06,190 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 110 flow [2022-12-06 05:05:06,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:06,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:06,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 110 flow [2022-12-06 05:05:06,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 110 flow [2022-12-06 05:05:06,201 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-06 05:05:06,201 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-06 05:05:06,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 42 events. 1/42 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2022-12-06 05:05:06,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 110 flow [2022-12-06 05:05:06,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:05:06,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1041] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (<= v_~cardSet_0~0_31 (+ 2147483647 v_~cardSet_4~0_29)))) (and (let ((.cse0 (= |v_thread1_#t~ite3#1_47| 0))) (or (and (= |v_thread1_minus_#res#1_153| |v_thread1_#t~ret4#1_65|) (= v_~cardId_2~0_55 |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_#in~b#1_131| v_~cardId_6~0_49) (<= 0 (+ |v_thread1_#t~ret4#1_65| 2147483648)) (<= |v_thread1_#t~ret4#1_65| 2147483647) (= (ite (or (<= |v_thread1_minus_~a#1_204| (+ 2147483647 |v_thread1_minus_~b#1_203|)) (<= 0 |v_thread1_minus_~b#1_203|)) 1 0) |v_thread1_assume_abort_if_not_#in~cond#1_169|) (= |v_thread1_#t~ite5#1_61| |v_thread1_#t~ret4#1_65|) (= |v_thread1_assume_abort_if_not_~cond#1_217| |v_thread1_assume_abort_if_not_#in~cond#1_169|) .cse0 (= |v_thread1_minus_~a#1_204| (+ |v_thread1_minus_#res#1_153| |v_thread1_minus_~b#1_203|)) (= |v_thread1_minus_~a#1_204| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_#in~b#1_131| |v_thread1_minus_~b#1_203|)) (and (= |v_thread1_minus_~b#1_204| |v_thread1_minus_~b#1_203|) (= |v_thread1_#t~ret4#1_65| |v_thread1Thread1of1ForFork2_#t~ret4#1_10|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ite5#1_61|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_#in~b#1_131|) (= |v_thread1_assume_abort_if_not_~cond#1_218| |v_thread1_assume_abort_if_not_~cond#1_217|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (not .cse0) (= |v_thread1_minus_#res#1_154| |v_thread1_minus_#res#1_153|) (= |v_thread1_minus_#in~a#1_132| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_minus_~a#1_204| |v_thread1_minus_~a#1_203|)))) (<= v_~cardSet_4~0_29 (+ v_~cardSet_0~0_31 2147483648)) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (let ((.cse1 (= |v_thread1_#t~ite5#1_61| 0))) (or (and (= |v_thread1_minus_#res#1_153| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_#t~ret6#1_10|) (= |v_thread1_assume_abort_if_not_~cond#1_217| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (not .cse1) (= v_~result_12~0_84 |v_thread1_#t~ite5#1_61|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1_minus_#in~a#1_131|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (= |v_thread1_minus_~b#1_203| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1_minus_#in~b#1_131| |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|) (= |v_thread1_minus_~a#1_204| |v_thread1Thread1of1ForFork2_minus_~a#1_7|)) (and (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread1Thread1of1ForFork2_minus_#res#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_7~0_53 |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_3~0_51 |v_thread1Thread1of1ForFork2_minus_#in~a#1_7|) (= v_~result_12~0_84 |v_thread1_#t~ret6#1_71|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_7| (+ 2147483647 |v_thread1Thread1of1ForFork2_minus_~b#1_7|)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_7|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread1_#t~ret6#1_71| 2147483647) .cse1 (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (<= 0 (+ |v_thread1_#t~ret6#1_71| 2147483648))))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0) (let ((.cse2 (= v_~cardSet_0~0_31 v_~cardSet_4~0_29))) (or (let ((.cse3 (ite (or (<= 0 v_~cardSet_4~0_29) .cse4) 1 0))) (and (= (+ |v_thread1_minus_#res#1_154| v_~cardSet_4~0_29) v_~cardSet_0~0_31) (= v_~cardSet_0~0_31 (+ |v_thread1_#t~ite3#1_47| v_~cardSet_4~0_29)) (= v_~cardSet_4~0_29 |v_thread1_minus_~b#1_204|) (not .cse2) (= |v_thread1_minus_~a#1_203| v_~cardSet_0~0_31) (= |v_thread1_minus_#in~b#1_132| v_~cardSet_4~0_29) (= |v_thread1_assume_abort_if_not_~cond#1_218| .cse3) (= |v_thread1_#t~ret2#1_51| |v_thread1Thread1of1ForFork2_#t~ret2#1_10|) (= v_~cardSet_0~0_31 |v_thread1_minus_#in~a#1_132|) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| .cse3))) (and (= |v_thread1_minus_#res#1_154| |v_thread1_#t~ret2#1_51|) (<= |v_thread1_#t~ret2#1_51| 2147483647) (= |v_thread1_minus_~a#1_203| |v_thread1_minus_#in~a#1_132|) .cse2 (= (+ |v_thread1_minus_#res#1_154| |v_thread1_minus_~b#1_204|) |v_thread1_minus_~a#1_203|) (<= 0 (+ |v_thread1_#t~ret2#1_51| 2147483648)) (= |v_thread1_assume_abort_if_not_~cond#1_218| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_minus_#in~b#1_132| v_~cardRarity_5~0_45) (= (ite (or (<= |v_thread1_minus_~a#1_203| (+ 2147483647 |v_thread1_minus_~b#1_204|)) (<= 0 |v_thread1_minus_~b#1_204|)) 1 0) |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= v_~cardRarity_1~0_51 |v_thread1_minus_#in~a#1_132|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ret2#1_51|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_~b#1_204|)))) .cse4)) InVars {thread1Thread1of1ForFork2_#t~ret6#1=|v_thread1Thread1of1ForFork2_#t~ret6#1_10|, ~cardId_2~0=v_~cardId_2~0_55, ~cardRarity_1~0=v_~cardRarity_1~0_51, ~cardSet_4~0=v_~cardSet_4~0_29, ~cardType_3~0=v_~cardType_3~0_51, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_10|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_10|, ~cardType_7~0=v_~cardType_7~0_53, ~cardRarity_5~0=v_~cardRarity_5~0_45, ~cardSet_0~0=v_~cardSet_0~0_31, ~cardId_6~0=v_~cardId_6~0_49} OutVars{thread1Thread1of1ForFork2_#t~ite7#1=|v_thread1Thread1of1ForFork2_#t~ite7#1_7|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_7|, ~cardType_3~0=v_~cardType_3~0_51, ~cardId_6~0=v_~cardId_6~0_49, ~cardId_2~0=v_~cardId_2~0_55, ~cardRarity_1~0=v_~cardRarity_1~0_51, ~cardType_7~0=v_~cardType_7~0_53, ~cardRarity_5~0=v_~cardRarity_5~0_45, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_7|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_7|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~cardSet_4~0=v_~cardSet_4~0_29, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_7|, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_7|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_7|, ~cardSet_0~0=v_~cardSet_0~0_31, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_7|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_7|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_7|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_7|, ~result_12~0=v_~result_12~0_84} AuxVars[|v_thread1_minus_#in~a#1_131|, |v_thread1_minus_#res#1_154|, |v_thread1_minus_#in~a#1_132|, |v_thread1_minus_~a#1_204|, |v_thread1_minus_#res#1_153|, |v_thread1_minus_#in~b#1_131|, |v_thread1_#t~ite3#1_47|, |v_thread1_minus_#in~b#1_132|, |v_thread1_assume_abort_if_not_#in~cond#1_169|, |v_thread1_minus_~a#1_203|, |v_thread1_minus_~b#1_203|, |v_thread1_#t~ret4#1_65|, |v_thread1_minus_~b#1_204|, |v_thread1_assume_abort_if_not_~cond#1_218|, |v_thread1_assume_abort_if_not_~cond#1_217|, |v_thread1_#t~ret2#1_51|, |v_thread1_#t~ite5#1_61|, |v_thread1_assume_abort_if_not_#in~cond#1_170|, |v_thread1_#t~ret6#1_71|] AssignedVars[thread1Thread1of1ForFork2_#t~ite7#1, thread1Thread1of1ForFork2_#t~ret6#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_minus_~a#1, ~result_12~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [1083] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (<= v_~cardSet_0~0_45 (+ 2147483647 v_~cardSet_8~0_35)))) (and (let ((.cse0 (= |v_thread2_#t~ite10#1_47| 0))) (or (and (= v_~cardId_2~0_67 |v_thread2_minus_#in~a#1_117|) (= |v_thread2_assume_abort_if_not_~cond#1_201| |v_thread2_assume_abort_if_not_#in~cond#1_150|) (= (+ |v_thread2_minus_#res#1_141| |v_thread2_minus_~b#1_187|) |v_thread2_minus_~a#1_187|) (= |v_thread2_assume_abort_if_not_#in~cond#1_150| (ite (or (<= 0 |v_thread2_minus_~b#1_187|) (<= |v_thread2_minus_~a#1_187| (+ 2147483647 |v_thread2_minus_~b#1_187|))) 1 0)) (<= |v_thread2_#t~ret11#1_55| 2147483647) (= v_~result_13~0_115 |v_thread2_#t~ret11#1_55|) (<= 0 (+ |v_thread2_#t~ret11#1_55| 2147483648)) (= |v_thread2_minus_#res#1_141| |v_thread2_#t~ret11#1_55|) (= |v_thread2_minus_~a#1_187| |v_thread2_minus_#in~a#1_117|) (= |v_thread2_minus_~b#1_187| |v_thread2_minus_#in~b#1_119|) .cse0 (= v_~cardId_10~0_47 |v_thread2_minus_#in~b#1_119|)) (and (= |v_thread2_assume_abort_if_not_#in~cond#1_149| |v_thread2_assume_abort_if_not_#in~cond#1_150|) (= |v_thread2_minus_#res#1_142| |v_thread2_minus_#res#1_141|) (= |v_thread2_minus_~a#1_188| |v_thread2_minus_~a#1_187|) (not .cse0) (= |v_thread2_minus_~b#1_188| |v_thread2_minus_~b#1_187|) (= |v_thread2_assume_abort_if_not_~cond#1_202| |v_thread2_assume_abort_if_not_~cond#1_201|) (= |v_thread2Thread1of1ForFork0_#t~ret11#1_6| |v_thread2_#t~ret11#1_55|) (= |v_thread2_minus_#in~b#1_119| |v_thread2_minus_#in~b#1_120|) (= |v_thread2_minus_#in~a#1_118| |v_thread2_minus_#in~a#1_117|) (= v_~result_13~0_115 |v_thread2_#t~ite10#1_47|)))) (<= v_~cardSet_8~0_35 (+ v_~cardSet_0~0_45 2147483648)) (let ((.cse1 (= v_~cardSet_0~0_45 v_~cardSet_8~0_35))) (or (and (= v_~cardRarity_1~0_61 |v_thread2_minus_#in~a#1_118|) (= v_~cardRarity_9~0_63 |v_thread2_minus_#in~b#1_120|) (= (+ |v_thread2_minus_#res#1_142| |v_thread2_minus_~b#1_188|) |v_thread2_minus_~a#1_188|) (= |v_thread2_assume_abort_if_not_~cond#1_202| |v_thread2_assume_abort_if_not_#in~cond#1_149|) (= |v_thread2_assume_abort_if_not_#in~cond#1_149| (ite (or (<= |v_thread2_minus_~a#1_188| (+ 2147483647 |v_thread2_minus_~b#1_188|)) (<= 0 |v_thread2_minus_~b#1_188|)) 1 0)) (= |v_thread2_#t~ret9#1_43| |v_thread2_#t~ite10#1_47|) (= |v_thread2_minus_~b#1_188| |v_thread2_minus_#in~b#1_120|) (= |v_thread2_minus_~a#1_188| |v_thread2_minus_#in~a#1_118|) (<= |v_thread2_#t~ret9#1_43| 2147483647) (<= 0 (+ |v_thread2_#t~ret9#1_43| 2147483648)) .cse1 (= |v_thread2_minus_#res#1_142| |v_thread2_#t~ret9#1_43|)) (let ((.cse2 (ite (or (<= 0 v_~cardSet_8~0_35) .cse3) 1 0))) (and (= |v_thread2_minus_~b#1_188| v_~cardSet_8~0_35) (= .cse2 |v_thread2_assume_abort_if_not_#in~cond#1_149|) (= v_~cardSet_0~0_45 (+ v_~cardSet_8~0_35 |v_thread2_#t~ite10#1_47|)) (= v_~cardSet_8~0_35 |v_thread2_minus_#in~b#1_120|) (not .cse1) (= .cse2 |v_thread2_assume_abort_if_not_~cond#1_202|) (= |v_thread2_#t~ret9#1_43| |v_thread2Thread1of1ForFork0_#t~ret9#1_6|) (= |v_thread2_minus_~a#1_188| v_~cardSet_0~0_45) (= (+ |v_thread2_minus_#res#1_142| v_~cardSet_8~0_35) v_~cardSet_0~0_45) (= v_~cardSet_0~0_45 |v_thread2_minus_#in~a#1_118|))))) (let ((.cse4 (= v_~result_13~0_115 0))) (or (and (= |v_thread2_minus_~a#1_187| |v_thread2Thread1of1ForFork0_minus_~a#1_5|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_5| |v_thread2_minus_#in~a#1_117|) (= |v_thread2_minus_~b#1_187| |v_thread2Thread1of1ForFork0_minus_~b#1_5|) (= |v_thread2_assume_abort_if_not_~cond#1_201| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2_assume_abort_if_not_#in~cond#1_150|) (= |v_thread2Thread1of1ForFork0_#t~ret13#1_6| |v_thread2_#t~ret13#1_51|) (not .cse4) (= v_~result_13~0_115 v_~result_13~0_114) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_5| |v_thread2_minus_#in~b#1_119|) (= |v_thread2_minus_#res#1_141| |v_thread2Thread1of1ForFork0_minus_#res#1_5|)) (and (= |v_thread2Thread1of1ForFork0_minus_#res#1_5| |v_thread2_#t~ret13#1_51|) (= (+ |v_thread2Thread1of1ForFork0_minus_#res#1_5| |v_thread2Thread1of1ForFork0_minus_~b#1_5|) |v_thread2Thread1of1ForFork0_minus_~a#1_5|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_5| v_~cardType_3~0_59) (= v_~result_13~0_114 |v_thread2_#t~ret13#1_51|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_5| |v_thread2Thread1of1ForFork0_minus_~b#1_5|) (<= |v_thread2_#t~ret13#1_51| 2147483647) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_5|) (<= |v_thread2Thread1of1ForFork0_minus_~a#1_5| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_5|))) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_5| |v_thread2Thread1of1ForFork0_minus_~a#1_5|) (= v_~cardType_11~0_55 |v_thread2Thread1of1ForFork0_minus_#in~b#1_5|) (<= 0 (+ |v_thread2_#t~ret13#1_51| 2147483648)) .cse4))) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0) .cse3)) InVars {~cardId_2~0=v_~cardId_2~0_67, ~cardRarity_1~0=v_~cardRarity_1~0_61, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_6|, ~cardType_11~0=v_~cardType_11~0_55, ~cardSet_8~0=v_~cardSet_8~0_35, thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_6|, ~cardType_3~0=v_~cardType_3~0_59, ~cardRarity_9~0=v_~cardRarity_9~0_63, ~cardId_10~0=v_~cardId_10~0_47, ~cardSet_0~0=v_~cardSet_0~0_45, thread2Thread1of1ForFork0_#t~ret13#1=|v_thread2Thread1of1ForFork0_#t~ret13#1_6|} OutVars{thread2Thread1of1ForFork0_#t~ite10#1=|v_thread2Thread1of1ForFork0_#t~ite10#1_5|, ~cardType_3~0=v_~cardType_3~0_59, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_5|, ~cardId_10~0=v_~cardId_10~0_47, ~cardId_2~0=v_~cardId_2~0_67, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_5|, ~cardRarity_1~0=v_~cardRarity_1~0_61, ~cardType_11~0=v_~cardType_11~0_55, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_5|, ~result_13~0=v_~result_13~0_114, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_5|, thread2Thread1of1ForFork0_#t~ret8#1=|v_thread2Thread1of1ForFork0_#t~ret8#1_5|, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_5|, thread2Thread1of1ForFork0_#t~ite12#1=|v_thread2Thread1of1ForFork0_#t~ite12#1_5|, ~cardSet_8~0=v_~cardSet_8~0_35, ~cardRarity_9~0=v_~cardRarity_9~0_63, ~cardSet_0~0=v_~cardSet_0~0_45, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#t~ite14#1=|v_thread2Thread1of1ForFork0_#t~ite14#1_5|} AuxVars[|v_thread2_assume_abort_if_not_~cond#1_202|, |v_thread2_assume_abort_if_not_~cond#1_201|, |v_thread2_assume_abort_if_not_#in~cond#1_149|, |v_thread2_minus_#in~b#1_119|, |v_thread2_minus_#in~a#1_117|, |v_thread2_minus_#in~a#1_118|, |v_thread2_#t~ite10#1_47|, |v_thread2_minus_#res#1_142|, |v_thread2_#t~ret11#1_55|, |v_thread2_minus_#res#1_141|, |v_thread2_minus_#in~b#1_120|, |v_thread2_#t~ret9#1_43|, |v_thread2_#t~ret13#1_51|, |v_thread2_minus_~b#1_187|, |v_thread2_minus_~b#1_188|, |v_thread2_minus_~a#1_188|, |v_thread2_minus_~a#1_187|, |v_thread2_assume_abort_if_not_#in~cond#1_150|, v_~result_13~0_115] AssignedVars[thread2Thread1of1ForFork0_#t~ite10#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#t~ite12#1, thread2Thread1of1ForFork0_#t~ret11#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_#t~ret13#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_#t~ite14#1, ~result_13~0, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret8#1] [2022-12-06 05:05:08,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:05:08,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2180 [2022-12-06 05:05:08,370 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 117 flow [2022-12-06 05:05:08,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:08,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:08,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:05:08,371 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 05:05:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1586819181, now seen corresponding path program 1 times [2022-12-06 05:05:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545476187] [2022-12-06 05:05:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:10,290 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 05:05:10,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545476187] [2022-12-06 05:05:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545476187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:10,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:10,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:05:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501731803] [2022-12-06 05:05:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:05:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:05:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:05:10,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:05:10,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 117 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 05:05:10,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:10,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:05:10,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:10,481 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-06 05:05:10,481 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 05:05:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 99 events. 31/99 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 324. Up to 61 conditions per place. [2022-12-06 05:05:10,486 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-06 05:05:10,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 223 flow [2022-12-06 05:05:10,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:05:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:05:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 05:05:10,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 05:05:10,488 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 117 flow. Second operand 5 states and 38 transitions. [2022-12-06 05:05:10,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 223 flow [2022-12-06 05:05:10,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 210 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:05:10,491 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-06 05:05:10,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-06 05:05:10,492 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 05:05:10,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:10,493 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-06 05:05:10,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:10,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:10,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-06 05:05:10,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-06 05:05:10,502 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 05:05:10,502 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:05:10,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 0/29 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 05:05:10,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-06 05:05:10,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 05:05:10,503 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:10,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:05:10,504 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-06 05:05:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 05:05:10,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:10,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:05:10,505 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 05:05:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2035286470, now seen corresponding path program 3 times [2022-12-06 05:05:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:10,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205864368] [2022-12-06 05:05:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:12,899 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 05:05:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205864368] [2022-12-06 05:05:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205864368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:12,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:12,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:05:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63458564] [2022-12-06 05:05:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:12,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:05:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:05:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:05:12,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:05:12,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:12,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:12,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:05:12,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:13,186 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-06 05:05:13,186 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 05:05:13,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 84 events. 28/84 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 278. Up to 37 conditions per place. [2022-12-06 05:05:13,187 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-06 05:05:13,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 216 flow [2022-12-06 05:05:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:05:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:05:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 05:05:13,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:05:13,188 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-06 05:05:13,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 216 flow [2022-12-06 05:05:13,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:05:13,189 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-06 05:05:13,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-06 05:05:13,190 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 05:05:13,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:13,190 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-06 05:05:13,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:13,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:13,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-06 05:05:13,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-06 05:05:13,195 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 05:05:13,195 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:05:13,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 16 events. 0/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 05:05:13,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-06 05:05:13,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 05:05:13,196 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:13,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:05:13,207 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-06 05:05:13,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:13,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:13,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:13,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:05:13,208 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 05:05:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2030110728, now seen corresponding path program 4 times [2022-12-06 05:05:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:13,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242068233] [2022-12-06 05:05:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:15,297 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 05:05:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:15,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242068233] [2022-12-06 05:05:15,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242068233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:05:15,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:05:15,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:05:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012166668] [2022-12-06 05:05:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:05:15,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:05:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:05:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:05:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:05:15,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:05:15,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:15,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:05:15,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:05:15,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:05:15,626 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-06 05:05:15,626 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 05:05:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-06 05:05:15,626 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-06 05:05:15,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-06 05:05:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:05:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:05:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 05:05:15,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 05:05:15,628 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-06 05:05:15,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-06 05:05:15,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 05:05:15,628 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-06 05:05:15,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-06 05:05:15,629 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 05:05:15,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:15,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-06 05:05:15,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:05:15,630 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:05:15,630 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:05:15,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:05:15,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:05:15,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:05:15,630 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:05:15,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 05:05:15,631 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:05:15,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:05:15,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:05:15,633 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:05:15,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:05:15,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:05:15,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:05:15,638 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-06 05:05:15,641 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:05:15,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:05:15,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:05:15 BasicIcfg [2022-12-06 05:05:15,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:05:15,643 INFO L158 Benchmark]: Toolchain (without parser) took 47065.76ms. Allocated memory was 190.8MB in the beginning and 733.0MB in the end (delta: 542.1MB). Free memory was 167.6MB in the beginning and 563.7MB in the end (delta: -396.1MB). Peak memory consumption was 147.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,643 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:05:15,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.31ms. Allocated memory is still 190.8MB. Free memory was 167.6MB in the beginning and 155.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,644 INFO L158 Benchmark]: Boogie Preprocessor took 44.51ms. Allocated memory is still 190.8MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,644 INFO L158 Benchmark]: RCFGBuilder took 1129.46ms. Allocated memory was 190.8MB in the beginning and 250.6MB in the end (delta: 59.8MB). Free memory was 150.3MB in the beginning and 173.2MB in the end (delta: -22.9MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,644 INFO L158 Benchmark]: TraceAbstraction took 45603.19ms. Allocated memory was 250.6MB in the beginning and 733.0MB in the end (delta: 482.3MB). Free memory was 172.6MB in the beginning and 563.7MB in the end (delta: -391.1MB). Peak memory consumption was 91.8MB. Max. memory is 8.0GB. [2022-12-06 05:05:15,645 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.31ms. Allocated memory is still 190.8MB. Free memory was 167.6MB in the beginning and 155.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 152.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.51ms. Allocated memory is still 190.8MB. Free memory was 152.4MB in the beginning and 150.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1129.46ms. Allocated memory was 190.8MB in the beginning and 250.6MB in the end (delta: 59.8MB). Free memory was 150.3MB in the beginning and 173.2MB in the end (delta: -22.9MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. * TraceAbstraction took 45603.19ms. Allocated memory was 250.6MB in the beginning and 733.0MB in the end (delta: 482.3MB). Free memory was 172.6MB in the beginning and 563.7MB in the end (delta: -391.1MB). Peak memory consumption was 91.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 121 PlacesBefore, 26 PlacesAfterwards, 113 TransitionsBefore, 16 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 77 TrivialYvCompositions, 18 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 117, independent conditional: 117, 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: 117, independent: 117, independent conditional: 0, independent unconditional: 117, 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: 117, independent: 117, independent conditional: 0, independent unconditional: 117, 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: 117, independent: 117, independent conditional: 0, independent unconditional: 117, 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: 117, independent: 117, independent conditional: 0, independent unconditional: 117, 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: 117, independent: 117, independent conditional: 0, independent unconditional: 117, 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: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 117, unknown conditional: 0, unknown unconditional: 117] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 2.0s, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 2.2s, 34 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 15, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 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): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 101]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 3454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:05:15,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...