/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:38:26,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:38:26,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:38:26,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:38:26,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:38:26,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:38:26,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:38:26,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:38:26,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:38:26,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:38:26,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:38:26,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:38:26,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:38:26,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:38:26,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:38:26,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:38:26,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:38:26,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:38:26,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:38:26,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:38:26,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:38:26,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:38:26,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:38:26,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:38:26,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:38:26,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:38:26,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:38:26,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:38:26,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:38:26,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:38:26,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:38:26,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:38:26,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:38:26,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:38:26,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:38:26,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:38:26,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:38:26,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:38:26,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:38:26,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:38:26,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:38:26,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:38:26,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:38:26,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:38:26,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:38:26,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:38:26,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:38:26,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:38:26,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:38:26,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:38:26,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:38:26,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:38:26,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:38:26,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:38:26,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:38:26,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:38:26,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:38:26,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:38:26,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:38:26,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:38:26,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:38:27,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:38:27,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:38:27,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:38:27,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:38:27,185 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:38:27,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2022-12-13 12:38:28,395 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:38:28,621 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:38:28,622 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2022-12-13 12:38:28,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbbae499/55136fb2d27c4eed9c8aceb6b84b0f17/FLAG4e555c7ce [2022-12-13 12:38:28,651 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dbbae499/55136fb2d27c4eed9c8aceb6b84b0f17 [2022-12-13 12:38:28,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:38:28,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:38:28,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:38:28,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:38:28,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:38:28,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:28,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f6573f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28, skipping insertion in model container [2022-12-13 12:38:28,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:28,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:38:28,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:38:28,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,888 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-trans.wvr.c[3481,3494] [2022-12-13 12:38:28,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:38:28,910 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:38:28,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:38:28,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:38:28,955 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-trans.wvr.c[3481,3494] [2022-12-13 12:38:28,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:38:28,975 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:38:28,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28 WrapperNode [2022-12-13 12:38:28,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:38:28,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:38:28,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:38:28,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:38:28,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,028 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 349 [2022-12-13 12:38:29,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:38:29,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:38:29,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:38:29,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:38:29,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,058 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:38:29,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:38:29,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:38:29,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:38:29,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (1/1) ... [2022-12-13 12:38:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:38:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:38:29,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:38:29,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:38:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:38:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 12:38:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 12:38:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:38:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:38:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:38:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:38:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:38:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:38:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:38:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:38:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:38:29,153 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:38:29,243 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:38:29,245 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:38:29,745 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:38:30,191 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:38:30,191 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:38:30,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:38:30 BoogieIcfgContainer [2022-12-13 12:38:30,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:38:30,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:38:30,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:38:30,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:38:30,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:38:28" (1/3) ... [2022-12-13 12:38:30,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeecd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:38:30, skipping insertion in model container [2022-12-13 12:38:30,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:28" (2/3) ... [2022-12-13 12:38:30,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeecd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:38:30, skipping insertion in model container [2022-12-13 12:38:30,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:38:30" (3/3) ... [2022-12-13 12:38:30,202 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2022-12-13 12:38:30,219 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:38:30,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:38:30,219 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:38:30,310 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 12:38:30,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 120 transitions, 264 flow [2022-12-13 12:38:30,419 INFO L130 PetriNetUnfolder]: 1/117 cut-off events. [2022-12-13 12:38:30,419 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:38:30,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 1/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2022-12-13 12:38:30,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 120 transitions, 264 flow [2022-12-13 12:38:30,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 107 transitions, 232 flow [2022-12-13 12:38:30,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:30,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 107 transitions, 232 flow [2022-12-13 12:38:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 107 transitions, 232 flow [2022-12-13 12:38:30,509 INFO L130 PetriNetUnfolder]: 1/107 cut-off events. [2022-12-13 12:38:30,509 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:38:30,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 1/107 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 19 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2022-12-13 12:38:30,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 107 transitions, 232 flow [2022-12-13 12:38:30,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 12:38:40,571 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 12:38:40,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:38:40,590 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;@6edac110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:38:40,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:38:40,597 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 12:38:40,598 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:38:40,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:40,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:40,599 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-13 12:38:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1563368137, now seen corresponding path program 1 times [2022-12-13 12:38:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:38:40,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148178360] [2022-12-13 12:38:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:38:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:38:44,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148178360] [2022-12-13 12:38:44,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148178360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:44,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:44,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:38:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500790458] [2022-12-13 12:38:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:44,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:38:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:38:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:38:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:38:44,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 12:38:44,160 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-13 12:38:44,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:44,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 12:38:44,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:44,526 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 12:38:44,527 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 12:38:44,530 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 285 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-13 12:38:44,532 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 12:38:44,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 12:38:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:38:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:38:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 12:38:44,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 12:38:44,545 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-13 12:38:44,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 12:38:44,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 12:38:44,549 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-13 12:38:44,551 INFO L277 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-13 12:38:44,554 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-13 12:38:44,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:38:44,555 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-13 12:38:44,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:38:44,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:44,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-13 12:38:44,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-13 12:38:44,582 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-13 12:38:44,583 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:38:44,584 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 44 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-13 12:38:44,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-13 12:38:44,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 12:38:44,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1076] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (<= v_~cardSet_0~0_37 (+ 2147483647 v_~cardSet_8~0_39)))) (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) .cse0 (let ((.cse1 (= |v_thread3_#t~ite17#1_31| 0))) (or (and (= |v_thread3_assume_abort_if_not_#in~cond#1_146| (ite (or (<= |v_thread3_minus_~a#1_178| (+ 2147483647 |v_thread3_minus_~b#1_178|)) (<= 0 |v_thread3_minus_~b#1_178|)) 1 0)) (<= |v_thread3_#t~ret18#1_45| 2147483647) .cse1 (= |v_thread3_minus_~b#1_178| |v_thread3_minus_#in~b#1_112|) (= |v_thread3_#t~ret18#1_45| |v_thread3_#t~ite19#1_43|) (= |v_thread3_minus_#in~a#1_108| v_~cardId_2~0_47) (= (+ |v_thread3_minus_~b#1_178| |v_thread3_minus_#res#1_134|) |v_thread3_minus_~a#1_178|) (= |v_thread3_#t~ret18#1_45| |v_thread3_minus_#res#1_134|) (= |v_thread3_assume_abort_if_not_~cond#1_199| |v_thread3_assume_abort_if_not_#in~cond#1_146|) (<= 0 (+ |v_thread3_#t~ret18#1_45| 2147483648)) (= |v_thread3_minus_~a#1_178| |v_thread3_minus_#in~a#1_108|) (= v_~cardId_10~0_59 |v_thread3_minus_#in~b#1_112|)) (and (not .cse1) (= |v_thread3_minus_#in~b#1_112| |v_thread3_minus_#in~b#1_111|) (= |v_thread3_assume_abort_if_not_#in~cond#1_146| |v_thread3_assume_abort_if_not_#in~cond#1_145|) (= |v_thread3_minus_~b#1_178| |v_thread3_minus_~b#1_177|) (= |v_thread3_minus_#in~a#1_108| |v_thread3_minus_#in~a#1_107|) (= |v_thread3_#t~ret18#1_45| |v_thread3Thread1of1ForFork1_#t~ret18#1_6|) (= |v_thread3_assume_abort_if_not_~cond#1_200| |v_thread3_assume_abort_if_not_~cond#1_199|) (= |v_thread3_minus_~a#1_178| |v_thread3_minus_~a#1_177|) (= |v_thread3_minus_#res#1_134| |v_thread3_minus_#res#1_133|) (= |v_thread3_#t~ite17#1_31| |v_thread3_#t~ite19#1_43|)))) (let ((.cse3 (= v_~cardSet_0~0_37 v_~cardSet_8~0_39))) (or (let ((.cse2 (ite (or .cse0 (<= 0 v_~cardSet_8~0_39)) 1 0))) (and (= |v_thread3_assume_abort_if_not_#in~cond#1_145| .cse2) (= v_~cardSet_0~0_37 (+ |v_thread3_#t~ite17#1_31| v_~cardSet_8~0_39)) (= |v_thread3_#t~ret16#1_33| |v_thread3Thread1of1ForFork1_#t~ret16#1_6|) (= v_~cardSet_8~0_39 |v_thread3_minus_#in~b#1_111|) (not .cse3) (= (+ v_~cardSet_8~0_39 |v_thread3_minus_#res#1_133|) v_~cardSet_0~0_37) (= |v_thread3_assume_abort_if_not_~cond#1_200| .cse2) (= |v_thread3_minus_~a#1_177| v_~cardSet_0~0_37) (= |v_thread3_minus_#in~a#1_107| v_~cardSet_0~0_37) (= |v_thread3_minus_~b#1_177| v_~cardSet_8~0_39))) (and (= |v_thread3_minus_~b#1_177| |v_thread3_minus_#in~b#1_111|) (= |v_thread3_assume_abort_if_not_#in~cond#1_145| (ite (or (<= |v_thread3_minus_~a#1_177| (+ 2147483647 |v_thread3_minus_~b#1_177|)) (<= 0 |v_thread3_minus_~b#1_177|)) 1 0)) (<= 0 (+ |v_thread3_#t~ret16#1_33| 2147483648)) (= |v_thread3_#t~ret16#1_33| |v_thread3_minus_#res#1_133|) (= |v_thread3_#t~ret16#1_33| |v_thread3_#t~ite17#1_31|) .cse3 (= |v_thread3_minus_~a#1_177| |v_thread3_minus_#in~a#1_107|) (= |v_thread3_assume_abort_if_not_~cond#1_200| |v_thread3_assume_abort_if_not_#in~cond#1_145|) (<= |v_thread3_#t~ret16#1_33| 2147483647) (= v_~cardRarity_9~0_71 |v_thread3_minus_#in~b#1_111|) (= (+ |v_thread3_minus_~b#1_177| |v_thread3_minus_#res#1_133|) |v_thread3_minus_~a#1_177|) (= v_~cardRarity_1~0_53 |v_thread3_minus_#in~a#1_107|)))) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (let ((.cse4 (= |v_thread3_#t~ite19#1_43| 0))) (or (and (= |v_thread3Thread1of1ForFork1_minus_~b#1_5| |v_thread3_minus_~b#1_178|) (= |v_thread3Thread1of1ForFork1_minus_~a#1_5| |v_thread3_minus_~a#1_178|) (= |v_thread3_#t~ite19#1_43| v_~result_14~0_108) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_5| |v_thread3_minus_#in~a#1_108|) (= |v_thread3Thread1of1ForFork1_minus_#in~b#1_5| |v_thread3_minus_#in~b#1_112|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3_assume_abort_if_not_#in~cond#1_146|) (= |v_thread3_assume_abort_if_not_~cond#1_199| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread3_#t~ret20#1_49| |v_thread3Thread1of1ForFork1_#t~ret20#1_6|) (= |v_thread3Thread1of1ForFork1_minus_#res#1_5| |v_thread3_minus_#res#1_134|) (not .cse4)) (and .cse4 (= |v_thread3Thread1of1ForFork1_minus_~b#1_5| |v_thread3Thread1of1ForFork1_minus_#in~b#1_5|) (= (+ |v_thread3Thread1of1ForFork1_minus_~b#1_5| |v_thread3Thread1of1ForFork1_minus_#res#1_5|) |v_thread3Thread1of1ForFork1_minus_~a#1_5|) (= |v_thread3Thread1of1ForFork1_minus_#in~a#1_5| v_~cardType_3~0_57) (<= 0 (+ |v_thread3_#t~ret20#1_49| 2147483648)) (= v_~cardType_11~0_61 |v_thread3Thread1of1ForFork1_minus_#in~b#1_5|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= |v_thread3_#t~ret20#1_49| v_~result_14~0_108) (= |v_thread3_#t~ret20#1_49| |v_thread3Thread1of1ForFork1_minus_#res#1_5|) (<= |v_thread3_#t~ret20#1_49| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= |v_thread3Thread1of1ForFork1_minus_~a#1_5| (+ |v_thread3Thread1of1ForFork1_minus_~b#1_5| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork1_minus_~b#1_5|)) 1 0)) (= |v_thread3Thread1of1ForFork1_minus_~a#1_5| |v_thread3Thread1of1ForFork1_minus_#in~a#1_5|)))) (<= v_~cardSet_8~0_39 (+ v_~cardSet_0~0_37 2147483648)))) InVars {thread3Thread1of1ForFork1_#t~ret18#1=|v_thread3Thread1of1ForFork1_#t~ret18#1_6|, ~cardId_2~0=v_~cardId_2~0_47, ~cardRarity_1~0=v_~cardRarity_1~0_53, ~cardType_11~0=v_~cardType_11~0_61, ~cardSet_8~0=v_~cardSet_8~0_39, ~cardType_3~0=v_~cardType_3~0_57, ~cardRarity_9~0=v_~cardRarity_9~0_71, thread3Thread1of1ForFork1_#t~ret20#1=|v_thread3Thread1of1ForFork1_#t~ret20#1_6|, ~cardId_10~0=v_~cardId_10~0_59, ~cardSet_0~0=v_~cardSet_0~0_37, thread3Thread1of1ForFork1_#t~ret16#1=|v_thread3Thread1of1ForFork1_#t~ret16#1_6|} OutVars{~cardType_3~0=v_~cardType_3~0_57, ~cardId_10~0=v_~cardId_10~0_59, thread3Thread1of1ForFork1_minus_~a#1=|v_thread3Thread1of1ForFork1_minus_~a#1_5|, ~cardId_2~0=v_~cardId_2~0_47, ~cardRarity_1~0=v_~cardRarity_1~0_53, ~cardType_11~0=v_~cardType_11~0_61, thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, thread3Thread1of1ForFork1_minus_~b#1=|v_thread3Thread1of1ForFork1_minus_~b#1_5|, thread3Thread1of1ForFork1_#t~ite17#1=|v_thread3Thread1of1ForFork1_#t~ite17#1_5|, thread3Thread1of1ForFork1_#t~ite19#1=|v_thread3Thread1of1ForFork1_#t~ite19#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~cardSet_8~0=v_~cardSet_8~0_39, ~cardRarity_9~0=v_~cardRarity_9~0_71, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~cardSet_0~0=v_~cardSet_0~0_37, thread3Thread1of1ForFork1_minus_#in~b#1=|v_thread3Thread1of1ForFork1_minus_#in~b#1_5|, thread3Thread1of1ForFork1_minus_#res#1=|v_thread3Thread1of1ForFork1_minus_#res#1_5|, 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_5|, ~result_14~0=v_~result_14~0_108, thread3Thread1of1ForFork1_minus_#in~a#1=|v_thread3Thread1of1ForFork1_minus_#in~a#1_5|} AuxVars[|v_thread3_assume_abort_if_not_#in~cond#1_146|, |v_thread3_minus_#in~a#1_108|, |v_thread3_minus_#in~b#1_112|, |v_thread3_minus_~b#1_177|, |v_thread3_assume_abort_if_not_#in~cond#1_145|, |v_thread3_minus_#in~a#1_107|, |v_thread3_minus_#in~b#1_111|, |v_thread3_minus_~b#1_178|, |v_thread3_minus_#res#1_133|, |v_thread3_#t~ret20#1_49|, |v_thread3_minus_#res#1_134|, |v_thread3_#t~ite17#1_31|, |v_thread3_assume_abort_if_not_~cond#1_199|, |v_thread3_minus_~a#1_178|, |v_thread3_assume_abort_if_not_~cond#1_200|, |v_thread3_minus_~a#1_177|, |v_thread3_#t~ite19#1_43|, |v_thread3_#t~ret16#1_33|, |v_thread3_#t~ret18#1_45|] 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 [1087] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (<= v_~cardSet_0~0_43 (+ 2147483647 v_~cardSet_4~0_41)))) (and .cse0 (let ((.cse1 (= |v_thread1_#t~ite3#1_47| 0))) (or (and (= |v_thread1_minus_#res#1_157| |v_thread1_#t~ret4#1_65|) (= v_~cardId_2~0_53 |v_thread1_minus_#in~a#1_130|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| (ite (or (<= 0 |v_thread1_minus_~b#1_205|) (<= |v_thread1_minus_~a#1_205| (+ 2147483647 |v_thread1_minus_~b#1_205|))) 1 0)) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1_assume_abort_if_not_#in~cond#1_169|) (<= 0 (+ |v_thread1_#t~ret4#1_65| 2147483648)) (<= |v_thread1_#t~ret4#1_65| 2147483647) (= |v_thread1_#t~ite5#1_61| |v_thread1_#t~ret4#1_65|) (= (+ |v_thread1_minus_#res#1_157| |v_thread1_minus_~b#1_205|) |v_thread1_minus_~a#1_205|) (= |v_thread1_minus_~a#1_205| |v_thread1_minus_#in~a#1_130|) .cse1 (= |v_thread1_minus_#in~b#1_131| v_~cardId_6~0_65) (= |v_thread1_minus_#in~b#1_131| |v_thread1_minus_~b#1_205|)) (and (= |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~a#1_129| |v_thread1_minus_#in~a#1_130|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_#in~b#1_131|) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1_assume_abort_if_not_~cond#1_207|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_minus_~b#1_206| |v_thread1_minus_~b#1_205|) (= |v_thread1_minus_#res#1_157| |v_thread1_minus_#res#1_158|) (not .cse1) (= |v_thread1_minus_~a#1_206| |v_thread1_minus_~a#1_205|)))) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (let ((.cse2 (= |v_thread1_#t~ite5#1_61| 0))) (or (and (= |v_thread1_minus_#res#1_157| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (= |v_thread1_minus_~a#1_205| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_#t~ret6#1_10|) (not .cse2) (= |v_thread1_minus_~b#1_205| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (= v_~result_12~0_94 |v_thread1_#t~ite5#1_61|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1_minus_#in~a#1_130|) (= |v_thread1_minus_#in~b#1_131| |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|)) (and (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= v_~cardType_7~0_61 |v_thread1Thread1of1ForFork2_minus_#in~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_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_3~0_63 |v_thread1Thread1of1ForFork2_minus_#in~a#1_7|) (= (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) .cse2 (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (<= 0 (+ |v_thread1_#t~ret6#1_71| 2147483648)) (= v_~result_12~0_94 |v_thread1_#t~ret6#1_71|)))) (<= v_~cardSet_4~0_41 (+ v_~cardSet_0~0_43 2147483648)) (let ((.cse3 (= v_~cardSet_0~0_43 v_~cardSet_4~0_41))) (or (let ((.cse4 (ite (or .cse0 (<= 0 v_~cardSet_4~0_41)) 1 0))) (and (= |v_thread1_minus_#in~b#1_132| v_~cardSet_4~0_41) (not .cse3) (= |v_thread1_minus_~a#1_206| v_~cardSet_0~0_43) (= |v_thread1_#t~ret2#1_51| |v_thread1Thread1of1ForFork2_#t~ret2#1_10|) (= v_~cardSet_4~0_41 |v_thread1_minus_~b#1_206|) (= v_~cardSet_0~0_43 |v_thread1_minus_#in~a#1_129|) (= (+ |v_thread1_minus_#res#1_158| v_~cardSet_4~0_41) v_~cardSet_0~0_43) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| .cse4) (= (+ |v_thread1_#t~ite3#1_47| v_~cardSet_4~0_41) v_~cardSet_0~0_43) (= |v_thread1_assume_abort_if_not_~cond#1_207| .cse4))) (and (= |v_thread1_minus_~a#1_206| |v_thread1_minus_#in~a#1_129|) (= |v_thread1_minus_~a#1_206| (+ |v_thread1_minus_#res#1_158| |v_thread1_minus_~b#1_206|)) (<= |v_thread1_#t~ret2#1_51| 2147483647) (= |v_thread1_minus_#in~b#1_132| v_~cardRarity_5~0_67) (<= 0 (+ |v_thread1_#t~ret2#1_51| 2147483648)) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_~b#1_206|) (= |v_thread1_minus_#res#1_158| |v_thread1_#t~ret2#1_51|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ret2#1_51|) .cse3 (= v_~cardRarity_1~0_59 |v_thread1_minus_#in~a#1_129|) (= |v_thread1_assume_abort_if_not_~cond#1_207| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| (ite (or (<= 0 |v_thread1_minus_~b#1_206|) (<= |v_thread1_minus_~a#1_206| (+ 2147483647 |v_thread1_minus_~b#1_206|))) 1 0))))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0))) InVars {thread1Thread1of1ForFork2_#t~ret6#1=|v_thread1Thread1of1ForFork2_#t~ret6#1_10|, ~cardId_2~0=v_~cardId_2~0_53, ~cardRarity_1~0=v_~cardRarity_1~0_59, ~cardSet_4~0=v_~cardSet_4~0_41, ~cardType_3~0=v_~cardType_3~0_63, 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_61, ~cardRarity_5~0=v_~cardRarity_5~0_67, ~cardSet_0~0=v_~cardSet_0~0_43, ~cardId_6~0=v_~cardId_6~0_65} 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_63, ~cardId_6~0=v_~cardId_6~0_65, ~cardId_2~0=v_~cardId_2~0_53, ~cardRarity_1~0=v_~cardRarity_1~0_59, ~cardType_7~0=v_~cardType_7~0_61, ~cardRarity_5~0=v_~cardRarity_5~0_67, 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_41, 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_43, 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_94} AuxVars[|v_thread1_minus_#in~a#1_130|, |v_thread1_minus_#res#1_157|, |v_thread1_minus_~a#1_205|, |v_thread1_minus_~a#1_206|, |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_~b#1_205|, |v_thread1_minus_~b#1_206|, |v_thread1_#t~ret4#1_65|, |v_thread1_assume_abort_if_not_~cond#1_208|, |v_thread1_assume_abort_if_not_~cond#1_207|, |v_thread1_#t~ret2#1_51|, |v_thread1_#t~ite5#1_61|, |v_thread1_minus_#in~a#1_129|, |v_thread1_minus_#res#1_158|, |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-13 12:38:46,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:38:46,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2374 [2022-12-13 12:38:46,929 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-13 12:38:46,929 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-13 12:38:46,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:46,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:46,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:38:46,930 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-13 12:38:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 776608377, now seen corresponding path program 2 times [2022-12-13 12:38:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:38:46,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751019666] [2022-12-13 12:38:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:38:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:38:48,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751019666] [2022-12-13 12:38:48,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751019666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:48,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:48,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:38:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110268632] [2022-12-13 12:38:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:48,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:38:48,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:38:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:38:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:38:48,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 12:38:48,994 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-13 12:38:48,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:48,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 12:38:48,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:49,299 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-13 12:38:49,300 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 12:38:49,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 428 event pairs, 7 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-13 12:38:49,301 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 11/48 dead transitions. [2022-12-13 12:38:49,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 251 flow [2022-12-13 12:38:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:38:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:38:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 12:38:49,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 12:38:49,303 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 46 transitions. [2022-12-13 12:38:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 251 flow [2022-12-13 12:38:49,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 247 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:38:49,307 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 103 flow [2022-12-13 12:38:49,307 INFO L277 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-13 12:38:49,308 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2022-12-13 12:38:49,308 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:38:49,308 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 103 flow [2022-12-13 12:38:49,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:38:49,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:49,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 103 flow [2022-12-13 12:38:49,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 103 flow [2022-12-13 12:38:49,326 INFO L130 PetriNetUnfolder]: 1/39 cut-off events. [2022-12-13 12:38:49,326 INFO L131 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2022-12-13 12:38:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 39 events. 1/39 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2022-12-13 12:38:49,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 103 flow [2022-12-13 12:38:49,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 12:38:49,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1087] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (<= v_~cardSet_0~0_43 (+ 2147483647 v_~cardSet_4~0_41)))) (and .cse0 (let ((.cse1 (= |v_thread1_#t~ite3#1_47| 0))) (or (and (= |v_thread1_minus_#res#1_157| |v_thread1_#t~ret4#1_65|) (= v_~cardId_2~0_53 |v_thread1_minus_#in~a#1_130|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| (ite (or (<= 0 |v_thread1_minus_~b#1_205|) (<= |v_thread1_minus_~a#1_205| (+ 2147483647 |v_thread1_minus_~b#1_205|))) 1 0)) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1_assume_abort_if_not_#in~cond#1_169|) (<= 0 (+ |v_thread1_#t~ret4#1_65| 2147483648)) (<= |v_thread1_#t~ret4#1_65| 2147483647) (= |v_thread1_#t~ite5#1_61| |v_thread1_#t~ret4#1_65|) (= (+ |v_thread1_minus_#res#1_157| |v_thread1_minus_~b#1_205|) |v_thread1_minus_~a#1_205|) (= |v_thread1_minus_~a#1_205| |v_thread1_minus_#in~a#1_130|) .cse1 (= |v_thread1_minus_#in~b#1_131| v_~cardId_6~0_65) (= |v_thread1_minus_#in~b#1_131| |v_thread1_minus_~b#1_205|)) (and (= |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~a#1_129| |v_thread1_minus_#in~a#1_130|) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_#in~b#1_131|) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1_assume_abort_if_not_~cond#1_207|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_minus_~b#1_206| |v_thread1_minus_~b#1_205|) (= |v_thread1_minus_#res#1_157| |v_thread1_minus_#res#1_158|) (not .cse1) (= |v_thread1_minus_~a#1_206| |v_thread1_minus_~a#1_205|)))) (= |v_thread1Thread1of1ForFork2_#res#1.base_7| 0) (let ((.cse2 (= |v_thread1_#t~ite5#1_61| 0))) (or (and (= |v_thread1_minus_#res#1_157| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (= |v_thread1_minus_~a#1_205| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= |v_thread1_assume_abort_if_not_~cond#1_208| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_#t~ret6#1_10|) (not .cse2) (= |v_thread1_minus_~b#1_205| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= |v_thread1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (= v_~result_12~0_94 |v_thread1_#t~ite5#1_61|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1_minus_#in~a#1_130|) (= |v_thread1_minus_#in~b#1_131| |v_thread1Thread1of1ForFork2_minus_#in~b#1_7|)) (and (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_7| |v_thread1Thread1of1ForFork2_minus_~b#1_7|) (= v_~cardType_7~0_61 |v_thread1Thread1of1ForFork2_minus_#in~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_thread1Thread1of1ForFork2_minus_#in~a#1_7| |v_thread1Thread1of1ForFork2_minus_~a#1_7|) (= v_~cardType_3~0_63 |v_thread1Thread1of1ForFork2_minus_#in~a#1_7|) (= (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) .cse2 (= |v_thread1_#t~ret6#1_71| |v_thread1Thread1of1ForFork2_minus_#res#1_7|) (<= 0 (+ |v_thread1_#t~ret6#1_71| 2147483648)) (= v_~result_12~0_94 |v_thread1_#t~ret6#1_71|)))) (<= v_~cardSet_4~0_41 (+ v_~cardSet_0~0_43 2147483648)) (let ((.cse3 (= v_~cardSet_0~0_43 v_~cardSet_4~0_41))) (or (let ((.cse4 (ite (or .cse0 (<= 0 v_~cardSet_4~0_41)) 1 0))) (and (= |v_thread1_minus_#in~b#1_132| v_~cardSet_4~0_41) (not .cse3) (= |v_thread1_minus_~a#1_206| v_~cardSet_0~0_43) (= |v_thread1_#t~ret2#1_51| |v_thread1Thread1of1ForFork2_#t~ret2#1_10|) (= v_~cardSet_4~0_41 |v_thread1_minus_~b#1_206|) (= v_~cardSet_0~0_43 |v_thread1_minus_#in~a#1_129|) (= (+ |v_thread1_minus_#res#1_158| v_~cardSet_4~0_41) v_~cardSet_0~0_43) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| .cse4) (= (+ |v_thread1_#t~ite3#1_47| v_~cardSet_4~0_41) v_~cardSet_0~0_43) (= |v_thread1_assume_abort_if_not_~cond#1_207| .cse4))) (and (= |v_thread1_minus_~a#1_206| |v_thread1_minus_#in~a#1_129|) (= |v_thread1_minus_~a#1_206| (+ |v_thread1_minus_#res#1_158| |v_thread1_minus_~b#1_206|)) (<= |v_thread1_#t~ret2#1_51| 2147483647) (= |v_thread1_minus_#in~b#1_132| v_~cardRarity_5~0_67) (<= 0 (+ |v_thread1_#t~ret2#1_51| 2147483648)) (= |v_thread1_minus_#in~b#1_132| |v_thread1_minus_~b#1_206|) (= |v_thread1_minus_#res#1_158| |v_thread1_#t~ret2#1_51|) (= |v_thread1_#t~ite3#1_47| |v_thread1_#t~ret2#1_51|) .cse3 (= v_~cardRarity_1~0_59 |v_thread1_minus_#in~a#1_129|) (= |v_thread1_assume_abort_if_not_~cond#1_207| |v_thread1_assume_abort_if_not_#in~cond#1_170|) (= |v_thread1_assume_abort_if_not_#in~cond#1_170| (ite (or (<= 0 |v_thread1_minus_~b#1_206|) (<= |v_thread1_minus_~a#1_206| (+ 2147483647 |v_thread1_minus_~b#1_206|))) 1 0))))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_7| 0))) InVars {thread1Thread1of1ForFork2_#t~ret6#1=|v_thread1Thread1of1ForFork2_#t~ret6#1_10|, ~cardId_2~0=v_~cardId_2~0_53, ~cardRarity_1~0=v_~cardRarity_1~0_59, ~cardSet_4~0=v_~cardSet_4~0_41, ~cardType_3~0=v_~cardType_3~0_63, 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_61, ~cardRarity_5~0=v_~cardRarity_5~0_67, ~cardSet_0~0=v_~cardSet_0~0_43, ~cardId_6~0=v_~cardId_6~0_65} 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_63, ~cardId_6~0=v_~cardId_6~0_65, ~cardId_2~0=v_~cardId_2~0_53, ~cardRarity_1~0=v_~cardRarity_1~0_59, ~cardType_7~0=v_~cardType_7~0_61, ~cardRarity_5~0=v_~cardRarity_5~0_67, 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_41, 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_43, 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_94} AuxVars[|v_thread1_minus_#in~a#1_130|, |v_thread1_minus_#res#1_157|, |v_thread1_minus_~a#1_205|, |v_thread1_minus_~a#1_206|, |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_~b#1_205|, |v_thread1_minus_~b#1_206|, |v_thread1_#t~ret4#1_65|, |v_thread1_assume_abort_if_not_~cond#1_208|, |v_thread1_assume_abort_if_not_~cond#1_207|, |v_thread1_#t~ret2#1_51|, |v_thread1_#t~ite5#1_61|, |v_thread1_minus_#in~a#1_129|, |v_thread1_minus_#res#1_158|, |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 [1040] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (<= v_~cardSet_4~0_31 (+ 2147483647 v_~cardSet_8~0_31)))) (and .cse0 (let ((.cse1 (= v_~result_13~0_117 0))) (or (and (= |v_thread2_#t~ret13#1_53| |v_thread2Thread1of1ForFork0_#t~ret13#1_10|) (= |v_thread2_minus_~a#1_184| |v_thread2Thread1of1ForFork0_minus_~a#1_7|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_7| |v_thread2_minus_#in~b#1_128|) (= |v_thread2_minus_~b#1_184| |v_thread2Thread1of1ForFork0_minus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_7| |v_thread2_minus_#in~a#1_123|) (= v_~result_13~0_117 v_~result_13~0_116) (not .cse1) (= |v_thread2_minus_#res#1_146| |v_thread2Thread1of1ForFork0_minus_#res#1_7|) (= |v_thread2_assume_abort_if_not_~cond#1_200| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2_assume_abort_if_not_#in~cond#1_157|)) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_7|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_7|)) 1 0)) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_7| |v_thread2Thread1of1ForFork0_minus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_minus_#res#1_7| |v_thread2_#t~ret13#1_53|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= 0 (+ |v_thread2_#t~ret13#1_53| 2147483648)) (= (+ |v_thread2Thread1of1ForFork0_minus_#res#1_7| |v_thread2Thread1of1ForFork0_minus_~b#1_7|) |v_thread2Thread1of1ForFork0_minus_~a#1_7|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_7| |v_thread2Thread1of1ForFork0_minus_~a#1_7|) (<= |v_thread2_#t~ret13#1_53| 2147483647) (= v_~result_13~0_116 |v_thread2_#t~ret13#1_53|) .cse1 (= v_~cardType_11~0_49 |v_thread2Thread1of1ForFork0_minus_#in~b#1_7|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_7| v_~cardType_7~0_55)))) (let ((.cse3 (= v_~cardSet_4~0_31 v_~cardSet_8~0_31))) (or (let ((.cse2 (ite (or .cse0 (<= 0 v_~cardSet_8~0_31)) 1 0))) (and (= |v_thread2_minus_~a#1_183| v_~cardSet_4~0_31) (= (+ v_~cardSet_8~0_31 |v_thread2_#t~ite10#1_49|) v_~cardSet_4~0_31) (= (+ |v_thread2_minus_#res#1_145| v_~cardSet_8~0_31) v_~cardSet_4~0_31) (= v_~cardSet_8~0_31 |v_thread2_minus_#in~b#1_127|) (= |v_thread2_minus_~b#1_183| v_~cardSet_8~0_31) (= |v_thread2_assume_abort_if_not_~cond#1_199| .cse2) (= |v_thread2_#t~ret9#1_45| |v_thread2Thread1of1ForFork0_#t~ret9#1_10|) (not .cse3) (= |v_thread2_assume_abort_if_not_#in~cond#1_158| .cse2) (= v_~cardSet_4~0_31 |v_thread2_minus_#in~a#1_124|))) (and (= |v_thread2_#t~ret9#1_45| |v_thread2_#t~ite10#1_49|) (= |v_thread2_minus_#res#1_145| |v_thread2_#t~ret9#1_45|) (= |v_thread2_minus_~a#1_183| |v_thread2_minus_#in~a#1_124|) (= v_~cardRarity_5~0_57 |v_thread2_minus_#in~a#1_124|) (= |v_thread2_assume_abort_if_not_~cond#1_199| |v_thread2_assume_abort_if_not_#in~cond#1_158|) (= v_~cardRarity_9~0_55 |v_thread2_minus_#in~b#1_127|) (<= 0 (+ |v_thread2_#t~ret9#1_45| 2147483648)) (= |v_thread2_minus_~b#1_183| |v_thread2_minus_#in~b#1_127|) (= (ite (or (<= |v_thread2_minus_~a#1_183| (+ 2147483647 |v_thread2_minus_~b#1_183|)) (<= 0 |v_thread2_minus_~b#1_183|)) 1 0) |v_thread2_assume_abort_if_not_#in~cond#1_158|) (<= |v_thread2_#t~ret9#1_45| 2147483647) (= |v_thread2_minus_~a#1_183| (+ |v_thread2_minus_#res#1_145| |v_thread2_minus_~b#1_183|)) .cse3))) (let ((.cse4 (= |v_thread2_#t~ite10#1_49| 0))) (or (and (= |v_thread2_minus_#res#1_146| |v_thread2_minus_#res#1_145|) (= |v_thread2_minus_~b#1_184| |v_thread2_minus_~b#1_183|) (= |v_thread2_assume_abort_if_not_#in~cond#1_158| |v_thread2_assume_abort_if_not_#in~cond#1_157|) (not .cse4) (= |v_thread2_minus_#in~a#1_124| |v_thread2_minus_#in~a#1_123|) (= |v_thread2_minus_#in~b#1_128| |v_thread2_minus_#in~b#1_127|) (= |v_thread2_assume_abort_if_not_~cond#1_200| |v_thread2_assume_abort_if_not_~cond#1_199|) (= |v_thread2_#t~ret11#1_57| |v_thread2Thread1of1ForFork0_#t~ret11#1_10|) (= |v_thread2_minus_~a#1_184| |v_thread2_minus_~a#1_183|) (= v_~result_13~0_117 |v_thread2_#t~ite10#1_49|)) (and (= (ite (or (<= |v_thread2_minus_~a#1_184| (+ 2147483647 |v_thread2_minus_~b#1_184|)) (<= 0 |v_thread2_minus_~b#1_184|)) 1 0) |v_thread2_assume_abort_if_not_#in~cond#1_157|) (= |v_thread2_minus_~b#1_184| |v_thread2_minus_#in~b#1_128|) .cse4 (<= |v_thread2_#t~ret11#1_57| 2147483647) (= |v_thread2_minus_~a#1_184| (+ |v_thread2_minus_#res#1_146| |v_thread2_minus_~b#1_184|)) (= |v_thread2_minus_~a#1_184| |v_thread2_minus_#in~a#1_123|) (= |v_thread2_minus_#in~a#1_123| v_~cardId_6~0_55) (= |v_thread2_minus_#res#1_146| |v_thread2_#t~ret11#1_57|) (<= 0 (+ |v_thread2_#t~ret11#1_57| 2147483648)) (= v_~cardId_10~0_45 |v_thread2_minus_#in~b#1_128|) (= |v_thread2_assume_abort_if_not_~cond#1_200| |v_thread2_assume_abort_if_not_#in~cond#1_157|) (= v_~result_13~0_117 |v_thread2_#t~ret11#1_57|)))) (<= v_~cardSet_8~0_31 (+ v_~cardSet_4~0_31 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0))) InVars {~cardSet_4~0=v_~cardSet_4~0_31, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_10|, ~cardType_11~0=v_~cardType_11~0_49, ~cardSet_8~0=v_~cardSet_8~0_31, thread2Thread1of1ForFork0_#t~ret11#1=|v_thread2Thread1of1ForFork0_#t~ret11#1_10|, ~cardRarity_9~0=v_~cardRarity_9~0_55, ~cardType_7~0=v_~cardType_7~0_55, ~cardRarity_5~0=v_~cardRarity_5~0_57, ~cardId_10~0=v_~cardId_10~0_45, thread2Thread1of1ForFork0_#t~ret13#1=|v_thread2Thread1of1ForFork0_#t~ret13#1_10|, ~cardId_6~0=v_~cardId_6~0_55} OutVars{thread2Thread1of1ForFork0_#t~ite10#1=|v_thread2Thread1of1ForFork0_#t~ite10#1_7|, 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_7|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_7|, ~cardId_10~0=v_~cardId_10~0_45, ~cardId_6~0=v_~cardId_6~0_55, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_7|, ~cardType_11~0=v_~cardType_11~0_49, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_7|, ~result_13~0=v_~result_13~0_116, ~cardType_7~0=v_~cardType_7~0_55, ~cardRarity_5~0=v_~cardRarity_5~0_57, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_7|, thread2Thread1of1ForFork0_#t~ret8#1=|v_thread2Thread1of1ForFork0_#t~ret8#1_7|, ~cardSet_4~0=v_~cardSet_4~0_31, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_7|, thread2Thread1of1ForFork0_#t~ite12#1=|v_thread2Thread1of1ForFork0_#t~ite12#1_7|, ~cardSet_8~0=v_~cardSet_8~0_31, ~cardRarity_9~0=v_~cardRarity_9~0_55, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#t~ite14#1=|v_thread2Thread1of1ForFork0_#t~ite14#1_7|} AuxVars[|v_thread2_assume_abort_if_not_~cond#1_200|, |v_thread2_assume_abort_if_not_~cond#1_199|, |v_thread2_assume_abort_if_not_#in~cond#1_157|, |v_thread2_minus_~a#1_184|, |v_thread2_assume_abort_if_not_#in~cond#1_158|, |v_thread2_minus_~a#1_183|, |v_thread2_minus_~b#1_183|, |v_thread2_minus_#in~b#1_128|, |v_thread2_minus_~b#1_184|, |v_thread2_minus_#in~b#1_127|, |v_thread2_#t~ite10#1_49|, |v_thread2_minus_#in~a#1_124|, v_~result_13~0_117, |v_thread2_minus_#in~a#1_123|, |v_thread2_#t~ret11#1_57|, |v_thread2_#t~ret9#1_45|, |v_thread2_minus_#res#1_146|, |v_thread2_minus_#res#1_145|, |v_thread2_#t~ret13#1_53|] 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-13 12:38:51,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:38:51,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2131 [2022-12-13 12:38:51,439 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 109 flow [2022-12-13 12:38:51,440 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-13 12:38:51,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:51,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:51,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:38:51,440 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-13 12:38:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 409912717, now seen corresponding path program 1 times [2022-12-13 12:38:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:38:51,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853785125] [2022-12-13 12:38:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:38:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:38:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853785125] [2022-12-13 12:38:53,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853785125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:53,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:53,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:38:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464838446] [2022-12-13 12:38:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:53,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:38:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:38:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:38:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:38:53,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 12:38:53,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 109 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-13 12:38:53,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:53,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 12:38:53,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:53,562 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-13 12:38:53,562 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 12:38:53,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 99 events. 31/99 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 338 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 312. Up to 61 conditions per place. [2022-12-13 12:38:53,568 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-13 12:38:53,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 217 flow [2022-12-13 12:38:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:38:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:38:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 12:38:53,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 12:38:53,571 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 109 flow. Second operand 5 states and 38 transitions. [2022-12-13 12:38:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 217 flow [2022-12-13 12:38:53,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 208 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 12:38:53,574 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-13 12:38:53,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, 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-13 12:38:53,576 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-13 12:38:53,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:38:53,576 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-13 12:38:53,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:38:53,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:53,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-13 12:38:53,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-13 12:38:53,587 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 12:38:53,588 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 12:38:53,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 29 events. 0/29 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 12:38:53,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-13 12:38:53,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 12:38:53,589 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:38:53,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 12:38:53,591 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-13 12:38:53,591 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-13 12:38:53,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:53,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:53,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:38:53,592 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-13 12:38:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -883238319, now seen corresponding path program 3 times [2022-12-13 12:38:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:38:53,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937131698] [2022-12-13 12:38:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:38:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:38:55,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937131698] [2022-12-13 12:38:55,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937131698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:55,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:55,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:38:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536115821] [2022-12-13 12:38:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:55,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:38:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:38:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:38:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:38:55,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 12:38:55,335 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-13 12:38:55,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:55,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 12:38:55,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:55,610 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-13 12:38:55,610 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-13 12:38:55,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 84 events. 28/84 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 269. Up to 37 conditions per place. [2022-12-13 12:38:55,611 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-13 12:38:55,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 215 flow [2022-12-13 12:38:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:38:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:38:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 12:38:55,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 12:38:55,612 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-13 12:38:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 215 flow [2022-12-13 12:38:55,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 12:38:55,614 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-13 12:38:55,614 INFO L277 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-13 12:38:55,615 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 12:38:55,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:38:55,615 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-13 12:38:55,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:38:55,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:55,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-13 12:38:55,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-13 12:38:55,622 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 12:38:55,622 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:38:55,623 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-13 12:38:55,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-13 12:38:55,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 12:38:55,623 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:38:55,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 12:38:55,624 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-13 12:38:55,625 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-13 12:38:55,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:55,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:55,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:38:55,625 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-13 12:38:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash 135329339, now seen corresponding path program 4 times [2022-12-13 12:38:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:38:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383511814] [2022-12-13 12:38:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:38:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:38:57,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383511814] [2022-12-13 12:38:57,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383511814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:57,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:57,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:38:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913769157] [2022-12-13 12:38:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:57,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:38:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:38:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:38:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:38:57,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 12:38:57,294 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-13 12:38:57,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:57,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 12:38:57,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:57,549 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-13 12:38:57,549 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 12:38:57,549 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 47 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-13 12:38:57,550 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-13 12:38:57,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-13 12:38:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:38:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:38:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-13 12:38:57,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 12:38:57,551 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-13 12:38:57,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-13 12:38:57,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 12:38:57,552 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-13 12:38:57,552 INFO L277 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-13 12:38:57,553 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-13 12:38:57,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:38:57,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-13 12:38:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:38:57,554 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:38:57,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:38:57,554 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-13 12:38:57,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:38:57,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:38:57,554 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:38:57,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:38:57,555 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:38:57,555 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-13 12:38:57,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 12:38:57,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 12:38:57,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 12:38:57,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 12:38:57,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:38:57,559 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 12:38:57,561 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:38:57,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:38:57,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:38:57 BasicIcfg [2022-12-13 12:38:57,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:38:57,565 INFO L158 Benchmark]: Toolchain (without parser) took 28910.22ms. Allocated memory was 189.8MB in the beginning and 433.1MB in the end (delta: 243.3MB). Free memory was 165.4MB in the beginning and 281.2MB in the end (delta: -115.8MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,565 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:38:57,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.74ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 152.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,566 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,566 INFO L158 Benchmark]: RCFGBuilder took 1116.39ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 148.1MB in the beginning and 121.9MB in the end (delta: 26.2MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,566 INFO L158 Benchmark]: TraceAbstraction took 27368.54ms. Allocated memory was 228.6MB in the beginning and 433.1MB in the end (delta: 204.5MB). Free memory was 120.9MB in the beginning and 281.2MB in the end (delta: -160.3MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB. [2022-12-13 12:38:57,567 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.74ms. Allocated memory is still 189.8MB. Free memory was 165.4MB in the beginning and 152.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 189.8MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1116.39ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 148.1MB in the beginning and 121.9MB in the end (delta: 26.2MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27368.54ms. Allocated memory was 228.6MB in the beginning and 433.1MB in the end (delta: 204.5MB). Free memory was 120.9MB in the beginning and 281.2MB in the end (delta: -160.3MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.1s, 116 PlacesBefore, 26 PlacesAfterwards, 107 TransitionsBefore, 16 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 72 TrivialYvCompositions, 18 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 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.3s, 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.1s, 33 PlacesBefore, 34 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: 100]: 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, 135 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: 27.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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.9s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1961 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-13 12:38:57,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...